< Back to previous page
A Practical Related-Key Boomerang Attack for the Full MMB Block Cipher
Book Contribution - Book Chapter Conference Contribution
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. © Springer International Publishing 2013.
Book: Lecture Notes in Computer Science
Pages: 281 - 290