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.
Cite
CITATION STYLE
Seki, H., & Kaneko, T. (2001). Differential cryptanalysis of reduced rounds of gost. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2012, pp. 315–323). Springer Verlag. https://doi.org/10.1007/3-540-44983-3_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
