Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA

  title={Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA},
  author={J.C. Hernandez and P. Isasi},
  journal={The 2003 Congress on Evolutionary Computation, 2003. CEC '03.},
  pages={2189-2193 Vol.3}
  • J.C. Hernandez, P. Isasi
  • Published 8 December 2003
  • Mathematics
  • The 2003 Congress on Evolutionary Computation, 2003. CEC '03.
A simple way of creating new and 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 rounds. 
9 Citations
New results on the genetic cryptanalysis of TEA and reduced-round versions of XTEA
  • J.C. Hernandez, P. Isasi
  • Computer Science
  • Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)
  • 2004
This cryptanalysis attack is shown to be successful when applied over reduced round versions of the block cipher XTEA and its results over TEA show to be the most powerful published to date. Expand
The Tiny Encryption Algorithm
The Tiny Encryption Algorithm is described, its simplicity of design and ease of use, its cryptographic strength, and the wide range of implementations and applications of the cipher. Expand
Breaching Security of Full Round Tiny Encryption Algorithm
A modest algorithm is introduced based on coincidence count and bit sum concept that makes it easy to find relevant plaintext corresponding to an arbitrary cipher text with a probability of 0.93. Expand
Applications of search techniques to cryptanalysis and the construction of cipher components.
The emphasis then shifts from the construction of cryptographic artefacts to the related area of cryptanalysis, in which non-linear approximations to S-boxes more powerful than the existing linear approximation are derived and exploited in cryptanalytic attacks against the ciphers DES and Serpent. Expand
Invited Paper. Nature-Inspired Cryptography: Past, Present and Future
Classical ciphers are based around the notions of character substitution and transposition. Messages are sequences of characters taken from some plaintext alphabet (e.g. the letters A to Z) and areExpand
Nature-inspired cryptography: past, present and future
  • John A. Clark
  • Computer Science
  • The 2003 Congress on Evolutionary Computation, 2003. CEC '03.
  • 2003
The author identifies what the author believes to be important themes and pieces of work and explain why they matter and the principal aim is to interest the us in the subject. Expand
A Survey of Cryptanalytic Works Based on Genetic Algorithms
Genetic Algorithms (GA) deal with the science of computational methods over the mechanisms of natural
Intelligent security algorithm for UNICODE data privacy and security in IOT
The Substitution box (S-box) that is dynamic and key-dependent that is suitable for handling UNICODE text and shows better performance is presented. Expand


Mod n Cryptanalysis, with Applications Against RC5P and M6
A form of partitioning attack that is effective against ciphers which rely on modular addition and bit rotations for their security, and that the general attack is extensible to other values of n. Expand
Correlations in RC6 with a Reduced Number of Rounds
It is shown that versions of RC6 with 128-bit blocks can be distinguished from a random permutation with up to 15 rounds; for some weak keys up to 17 rounds; and with an increased effort key-recovery attacks faster than exhaustive key search can be mounted on RC6. Expand
TEA, a Tiny Encryption Algorithm
We give a short routine which is based on a Feistel iteration and uses a large number of rounds to get security with simplicity.
Related-key cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA
New related-key attacks on the block ciphers 3WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA are presented, showing how to adapt the general attack to deal with the difficulties of the individual algorithms. Expand
Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA
The impossible differential cryptanalysis of reduced-round versions of XTEA and TEA is presented, and it is shown how to construct a 12-round impossible characteristic of X TEA and how to derive 128-bit user key of the 11-round TEA. Expand
The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition
  • R. Forré
  • Mathematics, Computer Science
  • 1988
A necessary and sufficient condition on the Walsh-spectrum of a boolean function is given, which implies that this function fulfills the Strict Avalanche Criterion. This condition is shown to beExpand
Encryption algorithms