Differential cryptanalysis of reduced rounds of GOST

DOI10.1007/3-540-44983-3_23MaRDI QIDQ2762766zbMATH OpenFDO

Authors Haruki Seki, Toshinobu Kaneko

Publication date 9 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2012/20120315

Mathematics Subject Classification ID

Cryptography (94A60)

Review text

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 \(2^{51}\) chosen plaintexts the key of 13-round GOST can be obtained. Next this differential cryptanalysis is expanded with combining related-key attack. Using \(2^{56}\) chosen plaintexts the key of 21 rounds of GOST can be obtained. For the entire collection see [Zbl 0961.00038].

Recommendations

• An improved differential attack on full GOST
• Linear and differential cryptanalysis of Russian GOST
• Fast Software Encryption
• Cryptanalysis of GOST in the multiple-key scenario
• Meet-in-the-middle attacks on reduced-round GOST

Cited in

(23)

• A single-key attack on the full GOST block cipher
• Regular subgroups with large intersection
• Upper bounds for the average probabilities of difference characteristics of block ciphers with alternation of Markov transformations and generalized Markov transformations
• Aggregated differentials and cryptanalysis of PP-1 and GOST
• Local reduction and the algebraic cryptanalysis of the block cipher GOST
• Linear and differential cryptanalysis of Russian GOST
• An improved differential attack on full GOST
• A single-key attack on the full GOST block cipher
• scientific article; zbMATH DE number 1823207 (Why is no real title available?)
• Cryptanalysis of the Round-Reduced GOST Hash Function
• A (Second) Preimage Attack on the GOST Hash Function
• Cryptanalysis of the GOST Hash Function
• scientific article; zbMATH DE number 1952898 (Why is no real title available?)
• Contradiction immunity and guess-then-determine attacks on GOST
• An attack on the GOST 28147-89 block cipher with 12 related keys
• On weak key-scheduling algorithms relatively the related-key attack
• Attacks on full block cipher GOST 28147-89 with 2 or 4 related keys
• Meet-in-the-middle attacks on reduced-round GOST
• Rotational cryptanalysis of GOST with identical S-boxes
• Reflection Cryptanalysis of Some Ciphers
• Fast Software Encryption
• Differential cryptanalysis of round-reduced \texttt{SPEEDY} family
• Practical-time related-key attack on GOST with secret S-boxes

This page was built for publication: Differential cryptanalysis of reduced rounds of GOST

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762766)