Finding Efficient Distinguishers for Cryptographic Mappings, with an Application to the Block Cipher TEA

e-Archivo Repository

Show simple item record

dc.contributor.author Hernández, Julio C.
dc.contributor.author Isasi, Pedro
dc.date.accessioned 2009-04-14T13:02:05Z
dc.date.available 2009-04-14T13:02:05Z
dc.date.issued 2004-08
dc.identifier.bibliographicCitation Computational Intelligence, 2004, vol. 20, n. 3, p. 517-525
dc.identifier.issn 0824-7935
dc.identifier.uri http://hdl.handle.net/10016/3944
dc.description.abstract A simple way of creating new and very efficient distinguishers for cryptographic primitives, such as block ciphers or hash functions, is introduced. This technique is then successfully applied over reduced round versions of the block cipher TEA, which is proven to be weak with less than five cycles.
dc.description.sponsorship This researchwas supported by project TIC2002-04498- C05-4 of the Spanish Ministerio de Ciencia y Tecnologia.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher Blackwell
dc.relation.isbasedon http://e-archivo.uc3m.es/handle/10016/4053
dc.rights © Blackwell
dc.subject.other Block cipher
dc.subject.other Cryptanalysis
dc.subject.other Distinguisher
dc.subject.other Genetic algorithms
dc.subject.other TEA
dc.title Finding Efficient Distinguishers for Cryptographic Mappings, with an Application to the Block Cipher TEA
dc.type article
dc.type.review PeerReviewed
dc.description.status Publicado
dc.relation.publisherversion http://dx.doi.org/10.1111/j.0824-7935.2004.00250.x
dc.subject.eciencia Informática
dc.identifier.doi 10.1111/j.0824-7935.2004.00250.x
dc.rights.accessRights openAccess
dc.identifier.publicationfirstpage 517
dc.identifier.publicationissue 3
dc.identifier.publicationtitle Computational Intelligence
dc.identifier.publicationvolume 20
 Find Full text

Files in this item

*Click on file's image for preview. (Embargoed files's preview is not supported)


This item appears in the following Collection(s)

Show simple item record