Expected values for the rational complexity of finite binary sequences | Designs, Codes and Cryptography Skip to main content

Advertisement

Springer Nature Link
Log in

Expected values for the rational complexity of finite binary sequences

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

2-Adic complexity plays an important role in cryptology. It measures the difficulty of outputting a binary sequence using a feedback with carry shift register. This paper studies the 2-adic complexity of finite sequences by investigating the corresponding rational complexity whose logarithm to the base 2 is just equal to the 2-adic complexity. Experiments show that the logarithm to the base 2 of the expected values for rational complexity is a good approximation to the expected values for the 2-adic complexity. Both a nontrivial lower bound and a nontrivial upper bound on the expected values for the rational complexity of finite sequences are given in the paper. In particular, the lower bound is much better than the upper bound.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Rueppel R.A.: Linear complexity and random sequences. In: Advances in Cryptology-Eurocrypt’85. Lecture Notes in Computer Science, vol. 219, pp. 167–188. Springer, Berlin (1986).

  2. Klapper A., Goresky M.: 2-Adic shift registers. In: Fast Software Encryption, Cambridge Security Work Shop. Lecture Notes in Computer Science, vol. 809, pp. 174–178. Springer, New York (1993).

  3. Klapper A., Goresky M.: Feedback shift registers, 2-adic span, and combiners with memory. J. Cryptol. 10, 111–147 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hu H.G., Feng D.G.: On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences. IEEE Trans. Inform. Theory 54(2), 874–883 (2008)

    Article  MathSciNet  Google Scholar 

  5. Klapper A., Goresky M.: Cryptanalysis based on 2-adic rational approximation. In: Advances in Cryptology—CRYPTO’95. Lecture Notes in Computer Science, vol. 963, pp. 262–273. Springer, Berlin (1995).

  6. Rosser J.B., Schoenfeld L.: Approximate formulas for some functions of prime numbers. Illinois J. Math. 6, 64–94 (1962)

    MATH  MathSciNet  Google Scholar 

  7. Hardy G., Littlewood J.E., Plya G.: Inequalities, 2nd edn. Cambridge University Press, UK (1988)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Zhengzhou Information Science and Technology Institute, Zhengzhou, People’s Republic of China

    Tian Tian & Wen-Feng Qi

  2. State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, People’s Republic of China

    Wen-Feng Qi

Authors
  1. Tian Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wen-Feng Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wen-Feng Qi.

Additional information

Communicated by P. Wild.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tian, T., Qi, WF. Expected values for the rational complexity of finite binary sequences. Des. Codes Cryptogr. 55, 65–79 (2010). https://doi.org/10.1007/s10623-009-9331-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-009-9331-x

Keywords

Mathematics Subject Classification (2000)

Search

Navigation