Cryptanalysis of fast encryption algorithm for multimedia FEA-M

doi:10.1109/LCOMM.2002.803486

Cryptanalysis of fast encryption algorithm for multimedia FEA-M

2002-09-01

13

PRE

AI

R

Ryuji Kohno

DOI：10.1109/LCOMM.2002.803486

原文链接

原文求助

摘要

En 中文

Certain weaknesses in the algebraic structure of recently proposed fast encryption algorithm for multimedia FEA-M are pointed out. It is shown that, when the secret key consists of k bits, under realistic chosen and known plaintext attacks, the secret key recovery has complexity proportional to 2k(2) and k(4), respectively, implying that FEA-M is an insecure algorithm even if the secret keys of 4096 bits are employed.

Keyword:

Boolean matrix

chosen plaintext attack

cryptanalysis

effective secret key size

encryption

known plaintext attack

multimedia

Cryptanalysis of fast encryption algorithm for multimedia FEA-M

摘要

期刊

机构

引用论文