Recent years have seen considerable interest in lightweight cryptography. One particular consequence is a renewed study of meet-inthe- 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-inthe- 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.
CITATION STYLE
Fuhr, T., & Minaud, B. (2015). Match box meet-in-the-middle attack against KATAN. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8540, pp. 61–81). Springer Verlag. https://doi.org/10.1007/978-3-662-46706-0_4
Mendeley helps you to discover research relevant for your work.