Skip to main content

Related-Key Chosen IV Attacks on Grain-v1 and Grain-128

  • Conference paper

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

Abstract

The slide resynchronization attack on Grain was proposed in [6]. This attack finds related keys and initialization vectors of Grain that generate the 1-bit shifted keystream sequence. In this paper, we extend the attack proposed in [6] and propose related-key chosen IV attacks on Grain-v1 and Grain-128. The attack on Grain-v1 recovers the secret key with 222.59 chosen IVs, 226.29-bit keystream sequences and 222.90 computational complexity. To recover the secret key of Grain-128, our attack requires 226.59 chosen IVs, 231.39-bit keystream sequences and 227.01 computational complexity. These works are the first known key recovery attacks on Grain-v1 and Grain-128.

This research was supported by the MKE(Ministry of Knowledge Economy), Korea, under the ITRC(Information Technology Research Center) support program supervised by the IITA(Institute of Information Technology Advancement) (IITA-2008-(C1090-0801-0025)).

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berbain, C., Gilbert, H., Maximov, A.: Cryptanalysis of Grain. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol. 4047, pp. 15–29. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Hell, M., Johansson, T., Meier, W.: Grain - A Stream Cipher for Constrained Environments, eSTREAM - ECRYPT Stream Cipher Project, Report 2005/010 (2005), http://www.ecrypt.eu.org/stream/ciphers/grain/grain.pdf

  3. Hell, M., Johansson, T., Meier, W.: Grain - A Stream Cipher for Constrained Environments, eSTREAM - ECRYPT Stream Cipher Project (2007), http://www.ecrypt.eu.org/stream/p3ciphers/grain/Grain_p3.pdf

  4. Hell, M., Johansson, T., Meier, W.: A Stream Cipher Proposal: Grain-128, eSTREAM - ECRYPT Stream Cipher Project (2007), http://www.ecrypt.eu.org/stream/p3ciphers/grain/Grain128_p3.pdf

  5. Khazaei, S., Hassanzadeh, M., Kiaei, M.: Distinguishing Attack on Grain, eSTREAM - ECRYPT Stream Cipher Project, Report 2005/071 (2005) http://www.ecrypt.eu.org/stream/papersdir/071.pdf

  6. Kücük, O.: Slide Resynchronization Attack on the Initialization of Grain 1.0, eSTREAM - ECRYPT Stream Cipher Project, Report 2006/044 (2006), http://www.ecrypt.eu.org/stream/papersdir/2006/044.ps

  7. Vielhaber, M.: Breaking ONE.FIVIUM by AIDA an Algebraic IV Differential Attack, Cryptology ePrint Archive: Report 2007/413 (2007), http://eprint.iacr.org/2007/413.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Yi Mu Willy Susilo Jennifer Seberry

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, Y., Jeong, K., Sung, J., Hong, S. (2008). Related-Key Chosen IV Attacks on Grain-v1 and Grain-128. In: Mu, Y., Susilo, W., Seberry, J. (eds) Information Security and Privacy. ACISP 2008. Lecture Notes in Computer Science, vol 5107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70500-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70500-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69971-2

  • Online ISBN: 978-3-540-70500-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics