DC FieldValueLanguage
dc.contributor.authorMihaljević, Miodrag J.en
dc.contributor.authorKohno, Ryujien
dc.date.accessioned2020-03-05T20:28:24Z-
dc.date.available2020-03-05T20:28:24Z-
dc.date.issued2002-09-01en
dc.identifier.issn1089-7798en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/131-
dc.description.abstractCryptanalysis 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.en
dc.publisherIEEE-
dc.relation.ispartofIEEE Communications Lettersen
dc.subjectBoolean matrix | Chosen plaintext attack | Cryptanalysis | Effective secret key size | Encryption | Known plaintext attack | Multimediaen
dc.titleCryptanalysis of fast encryption algorithm for multimedia FEA-Men
dc.typeArticleen
dc.identifier.doi10.1109/LCOMM.2002.803486en
dc.identifier.scopus2-s2.0-0036748614en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage382en
dc.relation.lastpage384en
dc.relation.issue9en
dc.relation.volume6en
dc.description.rankM21-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-3047-3020-
Show simple item record

SCOPUSTM   
Citations

16
checked on Apr 1, 2025

Page view(s)

20
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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