Differential Cryptanalysis of Reduced Rounds of GOST

  • Haruki Seki
  • Toshinobu Kaneko
Conference paper

DOI: 10.1007/3-540-44983-3_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2012)
Cite this paper as:
Seki H., Kaneko T. (2001) Differential Cryptanalysis of Reduced Rounds of GOST. In: Stinson D.R., Tavares S. (eds) Selected Areas in Cryptography. SAC 2000. Lecture Notes in Computer Science, vol 2012. Springer, Berlin, Heidelberg

Abstract

The block cipher GOST was proposed in former Soviet Union in 1989. In this paper we present the first result of differential cryptanalysis of GOST with reduced number of rounds. By introducing the idea of using a set of differential characteristics, which is a partitioning type, we can reduce the influence of the key value upon the probability as well as get high differential probability. Using 251 chosen plaintexts the key of 13-round GOST can be obtained. Next this differential cryptanalysis is expanded with combining related-key attack. Using 256 chosen plaintexts the key of 21 rounds of GOST can be obtained.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Haruki Seki
    • 1
  • Toshinobu Kaneko
    • 2
  1. 1.TAO (Telecommunications Advancement Organization of Japan)Kanagawa-kuJapan
  2. 2.Science University of TokyoChibaJapan

Personalised recommendations