Title

An Efficient Known Plaintext Attack on FEA-M

Publication Type

Conference Proceeding Article

Publication Date

10-2003

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.

Discipline

Information Security

Research Areas

Cybersecurity

Publication

Information and Communications Security: 5th International Conference, ICICS 2003, Huhehaote, China, October 10-13: Proceedings

Volume

2836

First Page

84

Last Page

87

ISBN

9783540399278

Identifier

10.1007/978-3-540-39927-8_8

Publisher

Springer Verlag

City or Country

Berlin

Additional URL

http://dx.doi.org/10.1007/978-3-540-39927-8_8