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

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.