@inproceedings{aa283ae6b15645fa89eca8a442ebe0e1,
title = "A practical related-key boomerang attack for the full MMB block cipher",
abstract = "The MMB block cipher (Modular Multiplication-based Block cipher) is an iterative block cipher designed by Daemen, Govaerts, and Vandewalle in 1993 as an improvement of the PES and IPES ciphers. In this paper we present several new related-key differential characteristics of MMB. These characteristics can be used to form several related-key boomerangs to attack the full MMB. Using 2 20 adaptive chosen plaintexts and ciphertexts we recover all key bits in 235.2 time for the full MMB. Our attack was experimentally verified, and it takes less than 15 minutes on a standard Intel i5 machine to recover the full MMB key. After showing this practical attack on the full key of the full MMB, we present attacks on extended versions of MMB with up to 8 rounds (which is two more rounds than in the full MMB). We recover 64 out of the 128 key in time of 232.2 for 7-round MMB, and time of 232 for 8-round MMB using 220 plaintexts.",
keywords = "Differential cryptanalysis, MMB, Related-key boomerang attack",
author = "Tomer Ashur and Orr Dunkelman",
year = "2013",
doi = "10.1007/978-3-319-02937-5_15",
language = "American English",
isbn = "9783319029368",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "271--290",
booktitle = "Cryptology and Network Security - 12th International Conference, CANS 2013, Proceedings",
address = "Germany",
note = "12th International Conference on Cryptology and Network Security, CANS 2013 ; Conference date: 20-11-2013 Through 22-11-2013",
}