Skip to main content
SpringerLink
Log in

Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators

  • Conference paper
Information Security and Cryptology (Inscrypt 2007)

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

Included in the following conference series:

  • 598 Accesses

Abstract

Binary sequences generated by nonlinearly filtering maximal length sequences with period 2n − 1 are studied in this paper. We focus on the particular class of normal filters and provide improved lower bounds on the linear complexity of generated keystreams. This is achieved by first proving properties of a special class of determinants which are associated to linearized polynomials over finite fields of characteristic 2 and then by applying the above to simplify generalizations of the root presence test.

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. Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)

    MATH  Google Scholar 

  2. Bernasconi, J., Günther, C.G.: Analysis of a nonlinear feedforward logic for binary sequence generators. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol. 219, pp. 161–166. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  3. Caballero-Gil, P.: Regular cosets and upper bounds on the linear complexity of certain sequences. In: Ding, C., et al. (eds.) Sequences and Their Applications. DMTCS, pp. 242–256. Springer, Heidelberg (1999)

    Google Scholar 

  4. De Cannière, C., Preneel, B.: Trivium – a stream cipher construction inspired by block cipher design principles. In: eSTREAM: ECRYPT Stream Cipher Project, Report 2005/030 (2005), http://www.ecrypt.eu.org/stream/

  5. Gammel, B., Göttfert, R., Kniffler, O.: The Achterbahn stream cipher. In: eSTREAM: ECRYPT Stream Cipher Project, Report 2005/002 (2005), http://www.ecrypt.eu.org/stream/

  6. García-Villalba, L.J., Fúster-Sabater, A.: On the linear complexity of the sequences generated by nonlinear filterings. Inform. Process. Lett. 76, 67–73 (2000)

    Article  MathSciNet  Google Scholar 

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

  8. Golomb, S.W.: Shift Register Sequences. Holden-Day, San Francisco (1967)

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  10. Groth, E.J.: Generation of binary sequences with controllable complexity. IEEE Trans. Inform. Theory 17, 288–296 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hell, M., Johansson, T., Meier, W.: Grain – a stream cipher for constrained environments. In eSTREAM: ECRYPT Stream Cipher Project, Report 2005/010 (2005), http://www.ecrypt.eu.org/stream/

  12. Key, E.L.: An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Trans. Inform. Theory 22, 732–736 (1976)

    Article  MATH  Google Scholar 

  13. Kolokotronis, N., Kalouptsidis, N.: On the linear complexity of nonlinearly filtered PN-sequences. IEEE Trans. Inform. Theory 49, 3047–3059 (2003)

    Article  MathSciNet  Google Scholar 

  14. Kolokotronis, N., Limniotis, K., Kalouptsidis, N.: Lower bounds on sequence complexity via generalised Vandermonde determinants. In: Gong, G., Helleseth, T., Song, H.-Y., Yang, K. (eds.) SETA 2006. LNCS, vol. 4086, pp. 271–284. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Lam, C., Gong, G.: A lower bound for the linear span of filtering sequences. In: State of the Art of Stream Ciphers – SASC (2004), pp. 220–233 (2004)

    Google Scholar 

  16. Lidl, R., Niederreiter, H.: Finite Fields. In: Encyclop. Math. Its Applic., 2nd edn., vol. 20, Cambridge Univ. Press, Cambridge (1996)

    Google Scholar 

  17. Macdonald, I.G.: Symmetric Functions and Hall Polynomials, 2nd edn. Oxford Univ. Press, Oxford (1995)

    MATH  Google Scholar 

  18. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

  19. Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory 15, 122–127 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  20. Paterson, K.G.: Root counting, the DFT and the linear complexity of nonlinear filtering. Des. Codes Cryptogr. 14, 247–259 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  21. Rønjom, S., Helleseth, T.: A new attack on the filter generator. IEEE Trans. Inform. Theory 53, 1752–1758 (2007)

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, TYPA Buildings, University Campus, 15784, Athens, Greece

    Nicholas Kolokotronis, Konstantinos Limniotis & Nicholas Kalouptsidis

Authors
  1. Nicholas Kolokotronis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstantinos Limniotis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicholas Kalouptsidis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dingyi Pei Moti Yung Dongdai Lin Chuankun Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kolokotronis, N., Limniotis, K., Kalouptsidis, N. (2008). Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds) Information Security and Cryptology. Inscrypt 2007. Lecture Notes in Computer Science, vol 4990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79499-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79499-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79498-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation