An Efficient Known Plaintext Attack on FEA-M

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2836)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Coppersmith, D., Winograd, S.: On the Asymptotic Complexity of Matrix Multiplication. SIAM Journal on Computing 11, 472–492 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Mihaljević, M.J., Kohno, R.: Cryptanalysis of Fast Encryption Algorithm for Multimedia FEA-M. IEEE Communications Letters 6(9), 382–385 (2002)CrossRefGoogle Scholar
  3. 3.
    Strassen, V.: Gaussian Elimination is not Optimal. Numerical Mathematics 13, 354–356 (1969)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Yi, X., Tan, C.H., Siew, C.K., Syed, M.R.: Fast Encryption for Multimedia. IEEE Transactions on Consumer Electronics 47(1), 101–107 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  1. 1.Institute for Infocomm ResearchSingapore

Personalised recommendations