Skip to main content
SpringerLink
Log in

Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences

  • Conference paper
Progress in Cryptology - INDOCRYPT 2005 (INDOCRYPT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3797))

Included in the following conference series:

Abstract

We prove a conjecture on the asymptotic behavior of the joint linear complexity profile of random multisequences over a finite field. This conjecture was previously shown only in the special cases of single sequences and pairs of sequences. We also establish an asymptotic formula for the expected value of the nth joint linear complexity of random multisequences over a finite field. These results are relevant for the theory of word-based stream ciphers.

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. Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. Elsevier, Amsterdam (1998)

    MATH  Google Scholar 

  2. Daemen, J., Clapp, C.: 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 

  3. 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 

  4. 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 

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

    MATH  Google Scholar 

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

  7. Feng, X.T., 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 

  8. 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 

  9. Fu, F.-W., Niederreiter, H., Su, M.: The expectation and variance of the joint of random periodic multisequences. J. Complexity (to appear)

    Google Scholar 

  10. 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 

  11. Loève, M.: Probability Theory, 3rd edn. Van Nostrand, New York (1963)

    MATH  Google Scholar 

  12. Meidl, W.: Discrete Fourier transform, joint and generalized joint 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 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. 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 

  16. 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 

  17. Niederreiter, H., Wang, H.X., Xing, C.P.: Function fields over finite fields and their applications to cryptography. In: Garcia, A., Stichtenoth, H. (eds.) Topics in Geometry, Coding Theory and Cryptography. Springer, Berlin (to appear)

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  20. L.-P. Wang and H. Niederreiter, 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 

  21. 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  MATH  MathSciNet  Google Scholar 

  22. 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 

  23. 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

  2. Temasek Laboratories, National University of Singapore, 5 Sports Drive 2, Singapore, 117508, Republic of Singapore

    Li-Ping Wang

Authors
  1. Harald Niederreiter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li-Ping Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Indian Statistical Institute, 203 B T Road, 700 108, Kolkata, India

    Subhamoy Maitra

  2. Indian Institute of Science, Bangalore

    C. E. Veni Madhavan

  3. Microsoft Research India Private Limited, “Scientia”, No:196/36, 2nd Main Road, Sadashivnagar, 560080, Bangalore, India

    Ramarathnam Venkatesan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niederreiter, H., Wang, LP. (2005). Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds) Progress in Cryptology - INDOCRYPT 2005. INDOCRYPT 2005. Lecture Notes in Computer Science, vol 3797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596219_2

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30805-8

  • Online ISBN: 978-3-540-32278-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation