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

Thumbnail Image
Identifiers
URI: https://hdl.handle.net/10016/3944
ISSN: 0824-7935
DOI: 10.1111/j.0824-7935.2004.00250.x
Files
finding_efficient-ps.pdf (286.45 KB)
Publication date
2004-08
Defense date
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
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.
Description
Keywords
Block cipher, Cryptanalysis, Distinguisher, Genetic algorithms, TEA
Bibliographic citation
Computational Intelligence, 2004, vol. 20, n. 3, p. 517-525
Collections
DI - GCERN - Artículos de revistas científicas