Skip to main content
Log in

Linearity properties of binary FCSR sequences

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

Abstract

Maximal length FCSR sequences, or l-sequences, are an important type of nonlinear sequences used for building stream ciphers. This paper studies the linearity properties of l-sequences. Although it is widely accepted that l-sequences have high linear complexities close to their half periods, it is shown that for most of the l-sequences, linear relations with large statistical advantage exist.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

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

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

  3. Qi W.F., Xu H.: Partial period distribution of FCSR sequences. IEEE Trans. Inform. Theory 49(3), 761–765 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Seo C., Lee S., Sung Y., Han K., Kim S.: A lower bound on the linear span of an FCSR. IEEE Trans. Inform. Theory 46(2), 691–693 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Goresky M., Klapper A.: Arithmetic crosscorrelations of feedback with carry shift register sequences. IEEE Trans. Inform. Theory 43(4), 1342–1345 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Xu H., Qi W.F.: Autocorrelations of maximum period FCSR sequences. SIAM J. Discrete Math. 20(3), 568–577 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

  8. Arnault F., Berger T.P.: F-FCSR: design of a new class of stream ciphers. In: Fast Software Encryption 2005. Lecture Notes in Computer Science, vol. 3557, pp. 83–97. Springer (2005).

  9. Hell M., Johansson T.: Breaking the F-FCSR-H stream cipher in real time. In: Advances in Cryptology-Asiacrypt 2008. Lecture Notes in Computer Science, vol. 5350, pp. 557–569. Springer, Berlin (2008).

  10. Goresky M., Klapper A.: Fibonacci and Galois representations of feedback-with-carry shift registers. IEEE Trans. Inform. Theory 48(11), 2826–2836 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hogg R.V., Tanis E.A.: Probability and Statistical Inference. MacMillan Publishing Co., New York (1977).

  12. Coppersmith D., Halevi S., Jutla C.: Cryptanalysis of stream ciphers with linear masking. In: Advances in Cryptology-Crypto 2002. Lecture Notes in Computer Science, vol. 2442, pp. 515–532. Springer, Berlin (2002).

  13. Canteaut A., Trabbia M.: Improved fast correlation attacks using parity-check equations of weight 4 and 5. In: Advances in Cryptology-Eurocrypt 2000. Lecture Notes in Computer Science, vol. 1807, pp. 573–588. Springer, Berlin (2000).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wen-Feng Qi.

Additional information

Communicated by C. Cid.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tian, T., Qi, WF. Linearity properties of binary FCSR sequences. Des. Codes Cryptogr. 52, 249–262 (2009). https://doi.org/10.1007/s10623-009-9280-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-009-9280-4

Keywords

Mathematics Subject Classifications (2000)

Navigation