Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2014, Volume 5, Issue 2, Pages 117–125
DOI: https://doi.org/10.4213/mvk124
(Mi mvk124)
 

Meet-in-the-middle attacks on reduced-round GOST

G. Sekara, N. Mouhabc, B. Preneelbc

a Indian Statistical Institute, Chennai Centre, SETS Campus, MGR Knowledge City, CIT Campus, Taramani, Chennai 600113, India
b Department of Electrical Engineering ESAT/COSIC, KU Leuven, Kasteelpark Arenberg 10 box 2452, 3001 Heverlee, Belgium
c iMinds, Belgium
References:
Abstract: The block cipher GOST (GOST 28147-89) is a Russian standard for encryption and message authentication that is included in OpenSSL 1.0.0. In this paper, we present meet-in-the-middle attacks on several block ciphers, each consisting of 22 or fewer rounds of GOST. Our $22$-round attack on rounds 10–31 requires only 5 known plaintexts and a computational effort equivalent to testing about $2^{223}$ keys for a success probability of $1-2^{-65}$. This attack is the best (going by the number of rounds) low data complexity key-recovery attack on GOST.
Key words: cryptanalysis, block cipher, meet-in-the-middle attack, Feistel network, GOST.
Received 25.IX.2013
Document Type: Article
UDC: 519.719.2
Language: English
Citation: G. Sekar, N. Mouha, B. Preneel, “Meet-in-the-middle attacks on reduced-round GOST”, Mat. Vopr. Kriptogr., 5:2 (2014), 117–125
Citation in format AMSBIB
\Bibitem{SekMouPre14}
\by G.~Sekar, N.~Mouha, B.~Preneel
\paper Meet-in-the-middle attacks on reduced-round GOST
\jour Mat. Vopr. Kriptogr.
\yr 2014
\vol 5
\issue 2
\pages 117--125
\mathnet{http://mi.mathnet.ru/mvk124}
\crossref{https://doi.org/10.4213/mvk124}
Linking options:
  • https://www.mathnet.ru/eng/mvk124
  • https://doi.org/10.4213/mvk124
  • https://www.mathnet.ru/eng/mvk/v5/i2/p117
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:357
    Full-text PDF :179
    References:59
    First page:17
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024