Skip to main content
SpringerLink
Log in

The Probabilistic Theory of the Joint Linear Complexity of Multisequences

  • Conference paper
Sequences and Their Applications – SETA 2006 (SETA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4086))

Included in the following conference series:

Abstract

The joint linear complexity and the joint linear complexity profile are standard complexity measures for multisequences in the context of word-based stream ciphers. The last few years have seen major advances in the theory of these complexity measures, especially with regard to probabilistic results on the behavior of random (periodic and nonperiodic) multisequences. This paper presents a survey of these developments as well as the necessary background for the results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armand, M.A.: Multisequence shift register synthesis over commutative rings with identity with applications to decoding cyclic codes over integer residue rings. IEEE Trans. Inform. Theory 50, 220–229 (2004)

    Article  MathSciNet  Google Scholar 

  2. Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. Elsevier, Amsterdam (1998)

    MATH  Google Scholar 

  3. Daemen, J., Clapp, C.S.K.: Fast hashing and stream encryption with PANAMA. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol. 1372, pp. 60–74. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Dai, Z.-D., Feng, X., Yang, J.-H.: Multi-continued fraction algorithm and generalized B-M algorithm over F 2. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 339–354. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Dai, Z.-D., Imamura, K., Yang, J.-H.: Asymptotic behavior of normalized linear complexity of multi-sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 129–142. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Dai, Z.-D., Yang, J.-H.: Linear complexity of periodically repeated random sequences. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 168–175. Springer, Heidelberg (1991)

    Google Scholar 

  7. Dawson, E., Simpson, L.: Analysis and design issues for synchronous stream ciphers. In: Niederreiter, H. (ed.) Coding Theory and Cryptology, pp. 49–90. World Scientific, Singapore (2002)

    Chapter  Google Scholar 

  8. Ding, C.: Proof of massey’s conjectured algorithm. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 345–349. Springer, Heidelberg (1988)

    Google Scholar 

  9. Ding, C., Shan, W., Xiao, G.: The Stability Theory of Stream Ciphers. LNCS, vol. 561. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  10. ECRYPT stream cipher project, available at: http://www.ecrypt.eu.org/stream

  11. Feng, G.-L., Tzeng, K.K.: A generalized Euclidean algorithm for multisequence shift-register synthesis. IEEE Trans. Inform. Theory 35, 584–594 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  12. Feng, G.-L., Tzeng, K.K.: A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes. IEEE Trans. Inform. Theory 37, 1274–1287 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  13. Feng, X., Dai, Z.-D.: Expected value of the linear complexity of two-dimensional binary sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 113–128. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Feng, X.T., Wang, Q.L., Dai, Z.D.: Multi-sequences with d-perfect property. J. Complexity 21, 230–242 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Fu, F.-W., Niederreiter, H., Su, M.: The expectation and variance of the joint linear complexity of random periodic multisequences. J. Complexity 21, 804–822 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  16. Gustavson, F.G.: Analysis of the Berlekamp-Massey linear feedback shift-register synthesis algorithm. IBM J. Res. Develop. 20, 204–212 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  17. Hawkes, P., Rose, G.G.: Exploiting multiples of the connection polynomial in word-oriented stream ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 303–316. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  18. Kamiya, N.: On multisequence shift register synthesis and generalized-minimum-distance decoding of Reed-Solomon codes. Finite Fields Appl. 1, 440–457 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  19. Massey, J.L., Serconek, S.: Linear complexity of periodic sequences: A general theory. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 358–371. Springer, Heidelberg (1996)

    Google Scholar 

  20. Meidl, W.: Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 101–112. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Meidl, W., Niederreiter, H.: On the expected value of the linear complexity and the k-error linear complexity of periodic sequences. IEEE Trans. Inform. Theory 48, 2817–2825 (2002)

    Article  MathSciNet  Google Scholar 

  22. Meidl, W., Niederreiter, H.: The expected value of the joint linear complexity of periodic multisequences. J. Complexity 19, 61–72 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  23. Meidl, W., Winterhof, A.: On the joint linear complexity profile of explicit inversive multisequences. J. Complexity 21, 324–336 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  24. Niederreiter, H.: Sequences with almost perfect linear complexity profile. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 37–51. Springer, Heidelberg (1988)

    Google Scholar 

  25. Niederreiter, H.: The probabilistic theory of linear complexity. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 191–209. Springer, Heidelberg (1988)

    Google Scholar 

  26. Niederreiter, H.: A combinatorial approach to probabilistic results on the linear-complexity profile of random sequences. J. Cryptology 2, 105–112 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  27. Niederreiter, H.: Some computable complexity measures for binary sequences. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and Their Applications, pp. 67–78. Springer, London (1999)

    Google Scholar 

  28. Niederreiter, H.: Linear complexity and related complexity measures for sequences. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 1–17. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  29. Niederreiter, H., Wang, L.-P.: Proof of a conjecture on the joint linear complexity profile of multisequences. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 13–22. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  30. Niederreiter, H., Wang, L.-P.: The asymptotic behavior of the joint linear complexity profile of multisequences. Monatsh. Math. (to appear)

    Google Scholar 

  31. Niederreiter, H., Xing, C.P.: Rational Points on Curves over Finite Fields: Theory and Applications. London Math. Soc. Lecture Note Series, vol. 285. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  32. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Berlin (1986)

    MATH  Google Scholar 

  33. Rueppel, R.A., ciphers, S.: Contemporary Cryptology: The Science of Information Integrity. In: Simmons, G.J. (ed.), pp. 65–134. IEEE Press, New York (1992)

    Google Scholar 

  34. Sakata, S.: Extension of the Berlekamp-Massey algorithm to N dimensions. Inform. and Comput. 84, 207–239 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  35. Schmidt, W.M.: Construction and estimation of bases in function fields. J. Number Theory 39, 181–224 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  36. B. Smeets, The linear complexity profile and experimental results on a randomness test of sequences over the finite field F q , Technical Report, Department of Information Theory, University of Lund, 1988.

    Google Scholar 

  37. Wang, L.-P., Niederreiter, H.: Enumeration results on the joint linear complexity of multisequences. Finite Fields Appl. (to appear), available online as document: doi:10.1016/j.ffa.2005.03.005

    Google Scholar 

  38. Wang, L.-P., Zhu, Y.-F., Pei, D.-Y.: On the lattice basis reduction multisequence synthesis algorithm. IEEE Trans. Inform. Theory 50, 2905–2910 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  39. Xing, C.P.: Multi-sequences with almost perfect linear complexity profile and function fields over finite fields. J. Complexity 16, 661–675 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  40. Xing, C., Lam, K.-Y., Wei, Z.: A class of explicit perfect multi-sequences. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 299–305. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore, 117543, Republic of Singapore

    Harald Niederreiter

Authors
  1. Harald Niederreiter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Guang Gong

  2. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Tor Helleseth

  3. Department of Electrical and Electronic Engineering, Yonsei University, 121-749, Seoul, Korea

    Hong-Yeop Song

  4. Dept. of Electronics and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    Kyeongcheol Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niederreiter, H. (2006). The Probabilistic Theory of the Joint Linear Complexity of Multisequences. In: Gong, G., Helleseth, T., Song, HY., Yang, K. (eds) Sequences and Their Applications – SETA 2006. SETA 2006. Lecture Notes in Computer Science, vol 4086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863854_2

Download citation

  • DOI: https://doi.org/10.1007/11863854_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44523-4

  • Online ISBN: 978-3-540-44524-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation