Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Coppersmith, D., Winograd, S.: On the Asymptotic Complexity of Matrix Multiplication. SIAM Journal on Computing 11, 472–492 (1982)
Mihaljević, M.J., Kohno, R.: Cryptanalysis of Fast Encryption Algorithm for Multimedia FEA-M. IEEE Communications Letters 6(9), 382–385 (2002)
Strassen, V.: Gaussian Elimination is not Optimal. Numerical Mathematics 13, 354–356 (1969)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, H., Bao, F., Deng, R.H. (2003). An Efficient Known Plaintext Attack on FEA-M. In: Qing, S., Gollmann, D., Zhou, J. (eds) Information and Communications Security. ICICS 2003. Lecture Notes in Computer Science, vol 2836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39927-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-39927-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20150-2
Online ISBN: 978-3-540-39927-8
eBook Packages: Springer Book Archive