Authors: Mihaljević, Miodrag J. 
Kohno, Ryuji
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Cryptanalysis of fast encryption algorithm for multimedia FEA-M
Journal: IEEE Communications Letters
Volume: 6
Issue: 9
First page: 382
Last page: 384
Issue Date: 1-Sep-2002
Rank: M21
ISSN: 1089-7798
DOI: 10.1109/LCOMM.2002.803486
Abstract: 
Cryptanalysis of fast encryption algorithm for multimedia FEA-M were presented. Two methods for cryptanalysis were proposed corresponding to the realistic chosen and known plaintext attacks. It was shown that a complete breakability of FEA-M is possible, even if a secret key of 4096 bits is employed.
Keywords: Boolean matrix | Chosen plaintext attack | Cryptanalysis | Effective secret key size | Encryption | Known plaintext attack | Multimedia
Publisher: IEEE

Show full item record

SCOPUSTM   
Citations

16
checked on May 29, 2024

Page view(s)

53
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.