Skip to main content
SpringerLink
Log in

Sequences of Period 2N–2

  • 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:

  • 1218 Accesses

Abstract

We derive a formula for the minimal polynomial of the termwise product of binary sequences of least periods 2N–2. The obtained results are important in the analysis of keystream generators based on binary nonlinear N-stage feedback shift registers producing sequences of period 2N–2. Sequences of period 2N–1 are also considered.

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. de Bruijn, N.G.: A combinatorial problem. Indag. Math. 8, 461–467 (1946)

    Google Scholar 

  2. Courtois, N.T.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Courtois, N.T., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345–359. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

  5. Fredricksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24, 195–221 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gammel, B.M., Göttfert, R.: Linear filtering of nonlinear shift-register sequences. In: Ytrehus, Ø. (ed.) WCC 2005. LNCS, vol. 3969, pp. 354–370. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Gammel, B.M., Göttfert, R., Kniffler, O.: ACHTERBAHN-80 and ACHTERBAHN-128/80, eSTREAM, ECRYPT Stream Cipher Project (June 2006), http://www.ecrypt.eu.org/stream/papers.html

  8. Golić, J.D.: On the linear complexity of functions of periodic GF(q) sequences. IEEE Trans. Inform. Theory 35, 69–75 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  9. Golomb, S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills, Cal. (1982)

    Google Scholar 

  10. Golomb, S.W., Gong, G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar. Cambridge Univ. Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  11. Göttfert, R.: Produkte von Schieberegisterfolgen, Ph.D. Thesis, Univ. of Vienna (1993)

    Google Scholar 

  12. Göttfert, R., Niederreiter, H.: On the linear complexity of products of shift-register sequences. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 151–158. Springer, Heidelberg (1994)

    Google Scholar 

  13. Göttfert, R., Niederreiter, H.: A general lower bound for the linear complexity of the product of shift-register sequences. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 223–229. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  14. Göttfert, R., Niederreiter, H.: On the minimal polynomial of the product of linear recurring sequences. Finite Fields Appl. 1, 204–218 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  15. Herlestam, T.: On functions of linear shift register sequences. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol. 219, pp. 119–129. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  16. Lidl, R., Niederreiter, H.: Finite Fields, Encyclopedia of Mathematics and Its Applications, vol. 20. Addison-Wesley, Reading (1983) (Now Cambridge Univ. Press)

    Google Scholar 

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

  18. Meier, W., Pasalic, E., Carlet, C.: Algebraic attacks and decomposition of Boolean functions. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 474–491. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Niederreiter, H.: Cryptology – The mathematical theory of data security. In: Mitsui, T., Nagasaka, K., Kano, T. (eds.) Prospects of Mathematical Science, pp. 189–209. World Sci. Pub., Singapore (1988)

    Google Scholar 

  20. Niederreiter, H.: Distribution properties of feedback shift register sequences. Problems Control Inform. Theory 15, 19–34 (1986)

    MATH  MathSciNet  Google Scholar 

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

  22. Niederreiter, H.: Some new cryptosystems based on feedback shift register sequences. Math. J. Okayama Univ. 30, 121–149 (1988)

    MATH  MathSciNet  Google Scholar 

  23. Niederreiter, H.: A simple and general approach to the decimation of feedback shift-register sequences. Problems Control Inform. Theory 17, 327–331 (1988)

    MATH  MathSciNet  Google Scholar 

  24. Rueppel, R.A., Staffelbach, O.J.: Products of linear recurring sequences with maximum complexity. IEEE Trans. Inform. Theory IT-33, 124–131 (1987)

    Article  Google Scholar 

  25. Selmer, E.S.: Linear Recurrence Relations over Finite Fields, Department of Mathematics, Univ. of Bergen (1966)

    Google Scholar 

  26. Zierler, N., Mills, H.W.: Products of linear recurring sequences. J. Algebra 27, 147–157 (1973)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Infineon Technologies AG, Am Campeon 1–12, 85579, Neubiberg, Germany

    Rainer Göttfert

Authors
  1. Rainer Göttfert
    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

Göttfert, R. (2006). Sequences of Period 2N–2. 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_19

Download citation

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

  • 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