|Key sizes||128 bits|
|Block sizes||128 bits|
|Best public cryptanalysis|
|Key recovery using 267 chosen plaintexts|
In cryptography, MMB (Modular Multiplication-based Block cipher) is a block cipher designed by Joan Daemen as an improved replacement for the IDEA cipher. 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.
- Slide 4[dead link]
- 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" (PDF/PostScript). Proceedings of the 3rd Symposium on: State and Progress of Research in Cryptography. Fondazione Ugo Bordoni. pp. 80–89. Retrieved 2007-02-14.CS1 maint: Uses authors parameter (link)
- M. Wang; J. Nakahara & Y. Sun (2009). "Cryptanalysis of the Full MMB Block Cipher" (PDF). Selected Areas in Cryptography 2009. Springer-Verlag. pp. 231–248. Retrieved 2010-04-24.
- Paulo Barreto's comments on MMB
- Chapter of Daemen's PhD thesis dealing with MMB[permanent dead link] (Postscript format) (The specification of MMB appears in section 11.5
|This cryptography-related article is a stub. You can help Wikipedia by expanding it.|