About: FEA-M

An Entity of Type: noble, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In cryptography, FEA-M (Fast Encryption Algorithm for Multimedia) is a block cipher developed in 2001 by X. Yi, C. H. Tan, C. K. Siew, and M. R. Syed. With the unusually large block size of 4096 bits, all of FEA-M's calculations operate on 64×64 binary matrices. Unlike most block ciphers, FEA-M does not use multiple rounds of encryption. Each block is encrypted using just two multiplications and two additions. The data is encrypted using a pair of session keys chosen for just that message. The key is an invertible matrix used to encrypt the session keys, and the encrypted session keys must be sent along with the ciphertext. Since only invertible matrices can be used for the key, the effective key size is about 4094.2 bits.

Property Value
dbo:abstract
  • In cryptography, FEA-M (Fast Encryption Algorithm for Multimedia) is a block cipher developed in 2001 by X. Yi, C. H. Tan, C. K. Siew, and M. R. Syed. With the unusually large block size of 4096 bits, all of FEA-M's calculations operate on 64×64 binary matrices. Unlike most block ciphers, FEA-M does not use multiple rounds of encryption. Each block is encrypted using just two multiplications and two additions. The data is encrypted using a pair of session keys chosen for just that message. The key is an invertible matrix used to encrypt the session keys, and the encrypted session keys must be sent along with the ciphertext. Since only invertible matrices can be used for the key, the effective key size is about 4094.2 bits. FEA-M is insecure; an attack found by and Tavares (2003) recovers the secret key using only 1 known plaintext and 2 chosen plaintexts. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 8706364 (xsd:integer)
dbo:wikiPageLength
  • 2849 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1084902215 (xsd:integer)
dbo:wikiPageWikiLink
dbp:blockSize
  • 4096 (xsd:integer)
dbp:bot
  • InternetArchiveBot (en)
dbp:cryptanalysis
  • Youssef and Tavares break it with 1 known plaintext and 2 chosen plaintexts (en)
dbp:date
  • August 2019 (en)
dbp:designers
  • X. Yi, C.H. Tan, C.K. Siew, and M.R. Syed (en)
dbp:fixAttempted
  • yes (en)
dbp:keySize
  • about 4094.2 bits (en)
dbp:name
  • FEA-M (en)
dbp:publishDate
  • 2001 (xsd:integer)
dbp:rounds
  • 1 (xsd:integer)
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdf:type
rdfs:comment
  • In cryptography, FEA-M (Fast Encryption Algorithm for Multimedia) is a block cipher developed in 2001 by X. Yi, C. H. Tan, C. K. Siew, and M. R. Syed. With the unusually large block size of 4096 bits, all of FEA-M's calculations operate on 64×64 binary matrices. Unlike most block ciphers, FEA-M does not use multiple rounds of encryption. Each block is encrypted using just two multiplications and two additions. The data is encrypted using a pair of session keys chosen for just that message. The key is an invertible matrix used to encrypt the session keys, and the encrypted session keys must be sent along with the ciphertext. Since only invertible matrices can be used for the key, the effective key size is about 4094.2 bits. (en)
rdfs:label
  • FEA-M (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License