Cryptanalysis of Two GOST Variants with 128-Bit Keys

Courtois, Nicolas T.

doi:10.1080/01611194.2014.915706

Cited by 3 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper does NOT cover the whole spectrum of what differential properties can bring in terms interesting or/and efficient attacks on GOST. In this paper we do not consider multiple key attacks [17,19,26,20, 39] and we do not try to develop or at more advanced "combination" attacks which combine the complexity reduction approach based on high-level self-similarity of [26,19,9] with advanced differential properties with 2,3 and 4 points, [26,20]. This paper is essentially a technical paper on simple yet highly-optimized truncated differential attacks in a single key scenario.…”

Section: Introductionmentioning

confidence: 99%

An Improved Differential Attack on Full GOST

Courtois

2016

The New Codebreakers

Self Cite

View full text Add to dashboard Cite

Abstract. GOST 28147-89 is a well-known block cipher and the official encryption standard of the Russian Federation. A 256-bit block cipher considered as an alternative for AES-256 and triple DES, having an amazingly low implementation cost and it is becoming increasingly popular [51,36]. Until 2010 researchers unanimously agreed that: "despite considerable cryptanalytic efforts spent in the past 20 years, GOST is still not broken", see [51] and in 2010 it was submitted to ISO 18033 to become a worldwide industrial encryption standard. In 2011 it was suddenly discovered that GOST can be broken and it is insecure on more than one account. There is a substantial variety of recent innovative attacks on GOST [9, 26, 37, 10-12, 31, 21, 19, 20]. We have reflection attacks [37,26], attacks with double, triple and even quadruple reflections [26,20], a large variety of self-similarity and black-box reduction attacks [9,26,19,20], some of which do not use any reflections whatsoever [26, 9] and few other. The final key recovery step in various attacks is in many cases a software algebraic attack [26, 9,20] or/and a Meet-In-The-Middle attack [37,26,31,21]. In differential attacks key bits are guessed and confirmed by the differential properties [54,[10][11][12][13][14]49] and there have already been quite a few papers about advanced differential attacks on GOST [54, 10-13, 49, 14, 22, 15]. There is also several even more advanced "combination" attacks which combine the complexity reduction approach based on high-level self-similarity of [26,19, 9] with various advanced differential properties with 2,3 or 4 points, see [26,20]. In this paper we consider some recent differential attacks on GOST [54, 10-14, 49, 15] and show how to further improve them. We present a single-key attack against full 32-round 256-bit GOST with time complexity of 2 179 which is substantially faster than any previous single key attack on GOST. * Note: This paper is a new extended and updated version of a paper with the same title [27] to appear in LNCS 9100, Springer in March 2016. This paper is substantially expanded compared to the earlier version from 2012. The main attack remains the same and also the same as in the Springer version [27]. The introduction, preliminary study and exploration of underlying cipher structure and properties attacks are however greatly expanded in order to show a bigger picture and provide useful insights. We explain in details the philosophy and the structure of our attacks, and the methodology of how one can find such attacks, cf. Part I, "Discovery of Advanced Differential Attacks on GOST", pages 9-24. We also cite recent related and follow-up work.

show abstract

Section: Introductionmentioning

confidence: 99%

An Improved Differential Attack on Full GOST

Courtois

2016

The New Codebreakers

Self Cite

View full text Add to dashboard Cite

show abstract

Efficient Slide Attacks

et al. 2017

View full text Add to dashboard Cite

GOST enhancement key processing with Triple Transposition Key

Rahim

Suprianto

Multazam

2019

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

The GOST algorithm is an algorithm that has good encryption and decryption speeds because the encryption and decryption process is simple with the use of keys that are not too good. Security in cryptographic ciphertext results is one of the factors that depends on the use of a good key too, one of the techniques that can be used is the Triple Transposition Key that processes keys as much as 3 x rounds with the transposition function. The Triple Transposition Key and GOST algorithms are combined during the key formation process so that the key obtained from the process of using the Triple Transposition Key algorithm is quite strong and minimizes the brute force attack. The use of the Triple Transposition Key algorithm on GOST can be used as an alternative to increase security on the key so that it does not have to have a combination of 2 or more algorithms that will only consume process resources and also do not significantly affect the speed of encryption and decryption.

show abstract

Cryptanalysis of Two GOST Variants with 128-Bit Keys

Cited by 3 publications

References 11 publications

An Improved Differential Attack on Full GOST

An Improved Differential Attack on Full GOST

Efficient Slide Attacks

GOST enhancement key processing with Triple Transposition Key

Contact Info

Product

Resources

About