logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Cryptanalysis of fast encryption algorithm for multimedia FEA-M

delete2002-09-01
delete13
PRE
AI
R
Ryuji Kohno
DOI：10.1109/LCOMM.2002.803486delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
Boolean matrix
chosen plaintext attack
cryptanalysis
effective secret key size
encryption
known plaintext attack
multimedia

Journal

IEEE Communications Letters cover
IEEE Communications Letters
IF:
4.4
Papers:
1.3W
Citations:
2.2W

Organization

No organization information available