Skip to main content

Periodic Properties of Counter Assisted Stream Ciphers

  • Conference paper
Topics in Cryptology – CT-RSA 2004 (CT-RSA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2964))

Included in the following conference series:

Abstract

This paper analyses periodic properties of counter assisted stream ciphers. In particular, we analyze constructions where the counter system also has the purpose of providing additional complexity. We then apply the results to the recently proposed stream cipher Rabbit, and increase the lower bound on the internal state period length from 2158 to 2215. With reasonable assumptions we illustrate that the period length of Rabbit is at least the period of the counter system, i.e. at least 2256-1. The investigations are related to a “mod 3” characteristic of Rabbit. Attacks based on this characteristic are discussed and found infeasible.

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. Shelah, S., Tsaban, B.: Efficient linear feedback shift registers with maximal period. Finite Fields and their Applications 8, 256–267 (2002)

    Article  MathSciNet  Google Scholar 

  2. Ekdahl, P., Johansson, T.: A New Version of the Stream Cipher SNOW. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 49–61. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Shamir, A., Tsaban, B.: Guaranteeing the Diversity of Number Generators. Information and Computation 171(2), 350–363 (2001), http://xxx.lanl.gov/abs/cs.CR/0112014

    Article  MATH  MathSciNet  Google Scholar 

  4. Coppersmith, D., Halevi, S., Jutla, C.: Cryptanalysis of Stream Ciphers with Linear Masking. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, p. 515. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Boesgaard, M., Vesterager, M., Pedersen, T., Christiansen, J., Scavenius, O.: Rabbit: A New High-Performance Stream Cipher. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 307–329. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Flajolet, P., Odlyzko, A.M.: Random Mapping statistics. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 329–354. Springer, Heidelberg (1990)

    Google Scholar 

  7. Kelsey, J., Schneier, B., Wagner, D.: Mod n Cryptanalysis, with Applications against RC5P and M6. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol. 1636, pp. 139–155. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. “mod n” Cryptanalysis of Rabbit, white paper, version 1.0 (2003), http://www.cryptico.com

  9. Rijmen, V.: Analysis of Rabbit, unpublished report (2003), http://www.cryptico.com

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Scavenius, O., Boesgaard, M., Pedersen, T., Christiansen, J., Rijmen, V. (2004). Periodic Properties of Counter Assisted Stream Ciphers. In: Okamoto, T. (eds) Topics in Cryptology – CT-RSA 2004. CT-RSA 2004. Lecture Notes in Computer Science, vol 2964. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24660-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24660-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20996-6

  • Online ISBN: 978-3-540-24660-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics