Distinguishing attacks on t-functions

  • Authors:
  • Simon Künzli;Pascal Junod;Willi Meier

  • Affiliations:
  • FH Aargau, Windisch, Switzerland;(Kudelski Group), Nagravision SA, Cheseaux, Switzerland;FH Aargau, Windisch, Switzerland

  • Venue:
  • Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Klimov and Shamir proposed a new class of simple cryptographic primitives named T-functions. For two concrete proposals based on the squaring operation, a single word T-function and a previously unbroken multi-word T-function with a 256-bit state, we describe an efficient distinguishing attack having a 232 data complexity. Furthermore, Hong et al. recently proposed two fully specified stream ciphers, consisting of multi-word T-functions with 128-bit states and filtering functions. We describe distinguishing attacks having a 222 and a 234 data complexity, respectively. The attacks have been implemented.