Skip to main content

Cryptographic Analysis of a Type of Sequence Generators

  • Conference paper
Information Systems Security (ICISS 2012)

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

Included in the following conference series:

  • 971 Accesses

Abstract

Pseudorandom bit generators based on shift registers with dynamic feedback are analyzed for their possible application in symmetric cryptography (stream ciphers). Certain cryptographic parameters such as maximum period or linear span are obtained for the generated sequences, while estimations for autocorrelation and cross-correlation of such sequences are presented too. Several remarks regarding the non convenience of such generators for cryptographic or CDMA applications are also stated.

This work was supported by CDTI (Spain) under Project Cenit-HESPERIA as well as by Ministry of Science and Innovation and European FEDER Fund under Project TIN2011-25452/TSI.

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

Access this chapter

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. Bluetooth, Specifications of the Bluetooth system, Version 1.1, http://www.bluetooth.com/

  2. Blackburn, S., Murphy, S., Paterson, K.: Comments on Theory and Applications of Cellular Automata to Cryptography. IEEE Trans. on Computers 46, 637–638 (1997)

    Article  MathSciNet  Google Scholar 

  3. eSTREAM, the ECRYPT Stream Cipher Project, The eSTREAM Portfolio in 2012 (2012), http://www.ecrypt.eu.org/documents/D.SYM.10-v1.pdf

  4. Fúster-Sabater, A., Caballero-Gil, P.: Concatenated Automata in Cryptanalysis of Stream Ciphers. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 611–616. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Fúster-Sabater, A., Caballero-Gil, P.: Chaotic Cellular Automata with Cryptographic Application. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 251–260. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. GSM, Global Systems for Mobile Communications, http://cryptome.org/gsm-a512.html

  7. Golomb, S.W.: Shift-Register Sequences, Revised edn. Aegean Park Press, Laguna Hill (1982)

    Google Scholar 

  8. Hu, H., Gong, G.: New sets of zero or low correlation zone sequences via interleaving techniques. IEEE Trans. Informat. Theory 56, 1702–1713 (2010)

    Article  MathSciNet  Google Scholar 

  9. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press (1996)

    Google Scholar 

  10. Massey, J.L.: Shift Register Synthesis and BCH Decoding. IEEE Trans. Informat. Theory 15, 122–127 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  11. Menezes, A.J., et al.: Handbook of Applied Cryptography. CRC Press, New York (1997)

    MATH  Google Scholar 

  12. Mita, R., Palumbo, G., Pennisi, S., Poli, M.: Pseudorandom bit generator based on dynamic linear feedback topology. Electronics Letters 38, 1097–1098 (2002)

    Article  Google Scholar 

  13. Muñoz, J., Peinado, A.: On the characteristic polynomial of the product of matrices with irreducible characteristic polynomials, Tecnical report UMA-IC03-A0-002 (2003)

    Google Scholar 

  14. Rivest, R.L.: The RC4 Encryption Algorithm. RSA Data Sec., Inc. (March 1998)

    Google Scholar 

  15. Rueppel, R.: Stream Ciphers. In: Simmons, G.J. (ed.) Contemporary Cryptology, The Science of Information, pp. 65–134. IEEE Press (1992)

    Google Scholar 

  16. Tan, S.K., Guan, S.U.: Evolving cellular automata to generate nonlinear sequences with desirable properties. Applied Soft Computing 7, 1131–1134 (2007)

    Article  Google Scholar 

  17. Tomassini, M., Perrenoud, M.: Cryptography with cellular automata. Applied Soft Computing 1, 151–160 (2001)

    Article  Google Scholar 

  18. Yet Another SSL (YASSL), http://www.yassl.com

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peinado, A., Fúster-Sabater, A. (2012). Cryptographic Analysis of a Type of Sequence Generators. In: Venkatakrishnan, V., Goswami, D. (eds) Information Systems Security. ICISS 2012. Lecture Notes in Computer Science, vol 7671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35130-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35130-3_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35129-7

  • Online ISBN: 978-3-642-35130-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics