Welcome to the resource topic for 2010/211
Title:
Practical-time Attack on the Full MMB Block Cipher
Authors: Keting Jia, Jiazhe Chen, Meiqin Wang, Xiaoyun Wang
Abstract:Modular Multiplication based Block Cipher (MMB) is a block cipher designed by Daemen \emph{et al.} as an alternative to the IDEA block cipher. In this paper, we give a practical-time attack on the full MMB with adaptive chosen plaintexts and ciphertexts. By the constructive sandwich distinguisher for 5 of the 6 rounds of MMB with amazingly high probability 1, we give the key recovery attack on the full MMB with data complexity 2^{40} and time complexity 2^{13.4} MMB encryptions. Then a rectangle-like sandwich attack on the full MMB is presented, with 2^{66.5} chosen plaintexts, 2^{64} MMB encryptions and 2^{70.5} memory bytes. By the way, we show an improved differential attack on the full MMB with data complexity of 2^{96} chosen plaintexts and ciphertexts, time complexity 2^{64} encryptions and 2^{66} bytes of memory.
ePrint: https://eprint.iacr.org/2010/211
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .