Courtois, NT;
(2013)
Low-Complexity Key Recovery Attacks on GOST Block Cipher.
Cryptologia
, 37
(1)
1 - 10.
10.1080/01611194.2012.739587.
![[thumbnail of 01611194%2E2012%2E739587.pdf]](https://discovery.ucl.ac.uk/style/images/fileicons/application_pdf.png) Preview |
PDF
01611194%2E2012%2E739587.pdf Download (427kB) |
Abstract
GOST is a well-known Russian government block cipher. Until 2010, there was no attack on GOST used in encryption, cf. [9]. More recently, quite a few distinct key recovery attacks on full GOST have been found: [1-4, 6, 7]. Most of these attacks work by so-called “complexity reduction” [1]; they reduce the problem of breaking the full 32-round GOST to an attack with 2,3,4 KP for 8 rounds of GOST. In this article, we develop an alternative last step for these attacks. We present a new meet-in-the-middle attack for eight rounds, which is faster than any previous attack. Then we present a guess-then-determine attack with software using an SAT solver, which, for the same running time, requires much less memory. As a result we are able to improve by a factor of up to 226 various attacks from [1, 3].
| Type: | Article |
|---|---|
| Title: | Low-Complexity Key Recovery Attacks on GOST Block Cipher |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1080/01611194.2012.739587 |
| Publisher version: | http://dx.doi.org/10.1080/01611194.2012.739587 |
| Language: | English |
| Additional information: | Copyright Nicolas T. Courtois This is an open-access article distributed under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/3.0/, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The moral rights of the named author(s) have been asserted. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/1388949 |
Archive Staff Only
 |
View Item |
