New results on the genetic cryptanalysis of TEA and reduced-round versions of XTEA

  • Authors:
  • Julio César Hernández Castro;Pedro Isasi Viñuela

  • Affiliations:
  • LIFL-CNRS, Villeneuve d'Ascq, France;Computer Science Department, Carlos III University, Leganés, Madrid, Spain

  • Venue:
  • New Generation Computing - Evolutionary computation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, a quick and simple way of creating very efficient distinguishers for cryptographic primitives such as block ciphers or hash functions, was presented and proved useful by the authors. In this paper, this cryptanalytic attack (named genetic cryptanalysis after its use of genetic algorithms) is shown to be successful when applied over reduced-round versions of the block cipher XTEA. Efficient distinguishers for XTEA are proposed for up to 1 cycles (8 rounds). Additionally, a variant of this genetic attack is also introduced, and their results over the block cipher TEA presented, which are the most powerful published to date.