An Efficient Known Plaintext Attack on FEA-M

Author

Hongjun WU, Institute for Infocomm Research, Singapore
Feng BAO, Institute for Infocomm Research, Singapore
Robert H. DENG, Singapore Management UniversityFollow

Publication Type

Conference Proceeding Article

Version

publishedVersion

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 2³⁷-bit chosen plaintext and 2⁶⁰-bit known plaintext, respectively. In this paper we give an efficient known plaintext attack against FEA-M. Our attack requires only 2²⁸-bit known plaintext and about 2³³ 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

City or Country

Berlin

Citation

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.
Available at: https://ink.library.smu.edu.sg/sis_research/1078

Copyright Owner and License

Publisher

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.

Additional URL

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