Premium
Finding Efficient Distinguishers for Cryptographic Mappings, with an Application to the Block Cipher TEA
Author(s) -
Hernandez Julio C.,
Isasi Pedro
Publication year - 2004
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.0824-7935.2004.00250.x
Subject(s) - block cipher , computer science , stream cipher , cryptography , mdc 2 , cryptographic primitive , hash function , arithmetic , theoretical computer science , block (permutation group theory) , cryptographic hash function , algorithm , mathematics , cryptographic protocol , computer security , combinatorics , double hashing
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.