An Efficient Known Plaintext Attack on FEA-M
Conference Proceeding Article
Yi et al. have proposed a cipher called the fast encryption algorithm for multimedia (FEA-M). Recently Mihaljevi and Kohno pointed out that FEA-M is insecure. However, their attacks are not efficient: their chosen plaintext attack and known plaintext attack require 237-bit chosen plaintext and 260-bit known plaintext, respectively. In this paper we give an efficient known plaintext attack against FEA-M. Our attack requires only 228-bit known plaintext and about 233 XOR operations.
Information and Communications Security: 5th International Conference, ICICS 2003, Huhehaote, China, October 10-13: Proceedings
City or Country
WU, Hongjun; BAO, Feng; and DENG, Robert H..
An Efficient Known Plaintext Attack on FEA-M. (2003). Information and Communications Security: 5th International Conference, ICICS 2003, Huhehaote, China, October 10-13: Proceedings. 2836, 84-87. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1078