论文信息 - Comments on the security of fast encryption algorithm for multimedia (FEA-M)

Comments on the security of fast encryption algorithm for multimedia (FEA-M)

We show that the Fast Encryption Algorithm for Multimedia (FEA-M) proposed by Yi et al. (IEEE Trans. Consumer Electronics, vol.47, no.1, p.101-7, 2001) is insecure. In particular, we present a simple attack that reduces the complexity of obtaining both the session key and the master key to solving a set of linear equations. The low complexity of the attack combined with its simplicity makes it feasible in many multimedia applications.

Amr M. Youssef | Stafford E. Tavares

[1] Adi Shamir,et al. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations , 2000, EUROCRYPT.

[2] Douglas R. Stinson,et al. Cryptography: Theory and Practice,Second Edition , 2002 .

[3] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[4] Deepa Kundur,et al. Spies, Thieves, and Lies: The Battle for Multimedia in the Digital Era , 2001, IEEE Multim..

[5] Xun Yi,et al. ID-based key agreement for multimedia encryption , 2002, IEEE Trans. Consumer Electron..

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

[7] Douglas R. Stinson,et al. Cryptography: Theory and Practice , 1995 .