An efficient known plaintext attack on FEA-M

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2836, Issue , 2003, Pages 84-87

  Wu, Hongjun ^a   Bao, Feng ^a   Deng, Robert H ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CHOSEN-PLAINTEXT ATTACK; ENCRYPTION ALGORITHMS; KNOWN-PLAINTEXT ATTACKS; PLAINTEXT; XOR OPERATION;

ALGORITHMS;

EID: 0142187802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39927-8_8     Document Type: Article

References (4)

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