Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Workshop on Fast Software Encryption

FSE 2012: Fast Software Encryption pp 9–28Cite as

  1. Home
  2. Fast Software Encryption
  3. Conference paper
Improved Attacks on Full GOST

Improved Attacks on Full GOST

  • Itai Dinur17,
  • Orr Dunkelman17,18 &
  • Adi Shamir17 
  • Conference paper
  • 1997 Accesses

  • 35 Citations

  • 4 Altmetric

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

Abstract

GOST is a well known block cipher which was developed in the Soviet Union during the 1970’s as an alternative to the US-developed DES. In spite of considerable cryptanalytic effort, until very recently there were no published single key attacks against its full 32-round version which were faster than the 2256 time complexity of exhaustive search. In February 2011, Isobe used the previously discovered reflection property in order to develop the first such attack, which requires 232 data, 264 memory and 2224 time. In this paper we introduce a new fixed point property and a better way to attack 8-round GOST in order to find improved attacks on full GOST: Given 232 data we can reduce the memory complexity from an impractical 264 to a practical 236 without changing the 2224 time complexity, and given 264 data we can simultaneously reduce the time complexity to 2192 and the memory complexity to 236.

Keywords

  • Block cipher
  • cryptanalysis
  • GOST
  • reflection property
  • fixed point property
  • 2D meet in the middle attack

Download conference paper PDF

References

  1. Biham, E., Dunkelman, O., Keller, N.: Improved Slide Attacks. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 153–166. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  2. Chaum, D., Evertse, J.-H.: Cryptanalysis of DES with a Reduced Number of Rounds. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 192–211. Springer, Heidelberg (1986)

    Google Scholar 

  3. Courtois, N.T.: Algebraic Complexity Reduction and Cryptanalysis of GOST. Cryptology ePrint Archive, Report 2011/626 (2011), http://eprint.iacr.org/

  4. Courtois, N.T.: Security Evaluation of GOST 28147-89 in View of International Standardisation. Cryptology ePrint Archive, Report 2011/211 (2011), http://eprint.iacr.org/

  5. Courtois, N.T., Misztal, M.: Differential Cryptanalysis of GOST. Cryptology ePrint Archive, Report 2011/312 (2011), http://eprint.iacr.org/

  6. Dinur, I., Dunkelman, O., Shamir, A.: Improved Attacks on Full GOST. Cryptology ePrint Archive, Report 2011/558 (2011), http://eprint.iacr.org/

  7. Fleischmann, E., Gorski, M., Huehne, J.-H., Lucks, S.: Key Recovery Attack on full GOST Block Cipher with Negligible Time and Memory. Presented at Western European Workshop on Research in Cryptology (WEWoRC) (2009)

    Google Scholar 

  8. Isobe, T.: A Single-Key Attack on the Full GOST Block Cipher. In: Joux, A. (ed.) FSE 2011. LNCS, vol. 6733, pp. 290–305. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  9. Kara, O.: Reflection Cryptanalysis of Some Ciphers. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 294–307. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  10. Kelsey, J., Schneier, B., Wagner, D.: Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 237–251. Springer, Heidelberg (1996)

    Google Scholar 

  11. Ko, Y., Hong, S., Lee, W., Lee, S., Kang, J.-S.: Related Key Differential Attacks on 27 Rounds of XTEA and Full-Round GOST. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 299–316. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  12. Mendel, F., Pramstaller, N., Rechberger, C.: A (Second) Preimage Attack on the GOST Hash Function. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 224–234. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  13. Mendel, F., Pramstaller, N., Rechberger, C., Kontak, M., Szmidt, J.: Cryptanalysis of the GOST Hash Function. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 162–178. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  14. National Bureau of Standards. Federal Information Processing Standard-Cryptographic Protection - Cryptographic Algorithm. GOST 28147-89 (1989)

    Google Scholar 

  15. OpenSSL. A Reference Implementation of GOST, http://www.openssl.org/source/

  16. Rudskoy, V.: On Zero Practical Significance of Key Recovery Attack on Full GOST Block Cipher with Zero Time and Memory. Cryptology ePrint Archive, Report 2010/111 (2010), http://eprint.iacr.org/

  17. Seki, H., Kaneko, T.: Differential Cryptanalysis of Reduced Rounds of GOST. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 315–323. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, The Weizmann Institute, Rehovot, Israel

    Itai Dinur, Orr Dunkelman & Adi Shamir

  2. Computer Science Department, University of Haifa, Israel

    Orr Dunkelman

Authors
  1. Itai Dinur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Orr Dunkelman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Adi Shamir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Paris-Rocquencourt, B.P. 105, 78153, Le Chesnay, France

    Anne Canteaut

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dinur, I., Dunkelman, O., Shamir, A. (2012). Improved Attacks on Full GOST. In: Canteaut, A. (eds) Fast Software Encryption. FSE 2012. Lecture Notes in Computer Science, vol 7549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34047-5_2

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-34047-5_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34046-8

  • Online ISBN: 978-3-642-34047-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature