Name
Abstract | ||
|---|---|---|
Recent years have seen considerable interest in lightweight cryptography. One particular consequence is a renewed study of meet-in-the-middle attacks, which aim to exploit the relatively simple key schedules often encountered in lightweight ciphers. In this paper we propose a new technique to extend the number of rounds covered by a meet-in-the-middle attack, called a match box. Furthermore, we demonstrate the use of this technique on the lightweight cipher KATAN, and obtain the best attack to date on all versions of KATAN. Specifically, we are able to attack 153 of the 254 rounds of KATAN32 with low data requirements, improving on the previous best attack on 115 rounds which requires the entire codebook. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-662-46706-0_4 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Cryptanalysis,Meet-in-the-middle,Biclique,Match box,KATAN | Lightweight cipher,Computer science,Computer security,Cryptanalysis,Exploit,Meet-in-the-middle attack,Schedule,Lightweight cryptography,Codebook,Meet in the middle | Conference |
Volume | ISSN | Citations |
8540 | 0302-9743 | 5 |
PageRank | References | Authors |
0.45 | 17 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Fuhr | 1 | 90 | 7.86 |
| Brice Minaud | 2 | 147 | 7.75 |