论文信息 - Cryptanalysis of fast encryption algorithm for multimedia FEA-M

Cryptanalysis of fast encryption algorithm for multimedia FEA-M

Certain weaknesses in the algebraic structure of the previously 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/sup 2/ and k/sup 4/, respectively, implying that FEA-M is an insecure algorithm even if the secret keys of 4096 bits are employed.

Ryuji Kohno | Miodrag J. Mihaljevic

[1] Xun Yi,et al. Fast encryption for multimedia , 2001, IEEE Trans. Consumer Electron..

[2] Ryuji Kohno,et al. On wireless communications privacy and security evaluation of encryption techniques , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[3] Hung-Min Sun. Cryptanalysis of a public-key cryptosystem based on generalized inverses of matrices , 2001, IEEE Communications Letters.