General | |
---|---|
Designers | Joan Daemen |
First published | 1993 |
Derived from | IDEA |
Successors | ABC |
Cipher detail | |
Key sizes | 128 bits |
Block sizes | 128 bits |
Structure | Substitution–permutation network[1] |
Rounds | 6 |
Best public cryptanalysis | |
Key recovery using 267 chosen plaintexts[2] |
In cryptography, MMB (Modular Multiplication-based Block cipher) is a block cipher designed by Joan Daemen as an improved replacement for the IDEA cipher.[3] Modular multiplication is the central element in the design. Weaknesses in the key schedule were identified by Eli Biham, and this, together with the cipher's not having been designed to resist linear cryptanalysis, meant that other designs were pursued instead, such as 3-Way.
MMB has a key size and block size of 128 bits.
References
- ↑ Slide 4
- ↑ K. Jia and J. Chen and M. Wang and X. Wang (2010), Practical-time Attack on the Full MMB Block Cipher (PDF), retrieved 2010-04-24
- ↑ Joan Daemen; René Govaerts; Joos Vandewalle (1993). "Block Ciphers Based on Modular Arithmetic". Proceedings of the 3rd Symposium on: State and Progress of Research in Cryptography. Fondazione Ugo Bordoni. pp. 80–89. CiteSeerX 10.1.1.52.2614.
- M. Wang; J. Nakahara & Y. Sun (2009). "Cryptanalysis of the Full MMB Block Cipher". Selected Areas in Cryptography 2009. Springer-Verlag. pp. 231–248. Archived from the original (PDF) on 2013-02-03. Retrieved 2010-04-24.
External links
- Paulo Barreto's comments on MMB
- Daemen's PhD thesis (The specification of MMB appears in section 11.5)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.