Skip to main content
SpringerLink
Log in

Improved results on the probabilistic theory of the joint linear complexity of multisequences

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

We improve previous results on the asymptotic behavior and the expected value of the joint linear complexity of random multisequences over finite fields. These results are of interest for word-based stream ciphers in cryptology.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Rueppel R A. Stream ciphers. In: Simmons G J, ed. Contemporary Cryptology: the Science of Information Integrity. New York: IEEE Press, 1992. 65–134

    Google Scholar 

  2. Moshchevitin N, Vielhaber M. On an improvement of a result by Niederreiter and Wang concerning the expected linear complexity of multisequences. arXiv:math/0703655v2

  3. Niederreiter H. The probabilistic theory of the joint linear complexity of multisequences. In: Gong G, Helleseth T, Song H Y, et al., eds. Sequences and their Applications-SETA 2006. LNCS, 4086. Berlin: Springer, 2006. 5–16

    Chapter  Google Scholar 

  4. 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. Progress in Cryptology — INDOCRYPT 2005. LNCS, 3797. Berlin: Springer, 2005. 13–22

    Chapter  Google Scholar 

  5. Niederreiter H, Wang L P. The asymptotic behavior of the joint linear complexity profile of multisequences. Monatsh Math, 2007, 150: 141–155

    Article  MATH  MathSciNet  Google Scholar 

  6. Vielhaber M, Canales Chacón M. The asymptotic normalized linear complexity of multisequences. J Complexity, 2008, 24: 410–422

    Article  MATH  MathSciNet  Google Scholar 

  7. Lidl R, Niederreiter H. Finite Fields. Cambridge: Cambridge University Press, 1997. Chapter 8

    Google Scholar 

  8. Winterhof A. Linear complexity and related complexity measures. In: Woungang I, Misra S, Misra S C, eds. Selected Topics in Information and Coding Theory. Singapore: World Scientific, 2010. 3–40

    Chapter  Google Scholar 

  9. Rueppel R A. Analysis and Design of Stream Ciphers. Berlin: Springer, 1986. Chapter 4

    MATH  Google Scholar 

  10. 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, eds. Sequences and their Applications — SETA 2004. LNCS, 3486. Berlin: Springer, 2005. 113–128

    Chapter  Google Scholar 

  11. Wang L P, Niederreiter H. Enumeration results on the joint linear complexity of multisequences. Finite Field Appl, 2006, 12: 613–637

    Article  MATH  MathSciNet  Google Scholar 

  12. Loève M. Probability Theory. 3rd ed. Van Nostrand: New York, 1963. 228

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstr. 69, A-4040, Linz, Austria

    Harald Niederreiter

  2. Department of Mathematics, University of Salzburg, Hellbrunnerstr. 34, A-5020, Salzburg, Austria

    Harald Niederreiter

  3. Hochschule Bremerhaven, FB2, An der Karlstadt 8, D-27568, Bremerhaven, Germany

    Michael Vielhaber

  4. Institute for Advanced Study, Tsinghua University, Beijing, 100084, China

    LiPing Wang

Authors
  1. Harald Niederreiter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Vielhaber
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. LiPing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to LiPing Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Niederreiter, H., Vielhaber, M. & Wang, L. Improved results on the probabilistic theory of the joint linear complexity of multisequences. Sci. China Inf. Sci. 55, 165–170 (2012). https://doi.org/10.1007/s11432-011-4369-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-011-4369-6

Keywords

Search

Navigation