Advertisement

Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers

  • Julio César Hernández
  • José María Sierra
  • Arturo Ribagorda
  • Benjamín Ramos
  • J. C. Mex-Perera
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2260)

Abstract

In this paper the authors present a statistical test for testing the strict avalanche criterion (SAC), a property that cryptographic primitives such as block ciphers and hash functions must have. Random permutations should also behave as good random number generators when, given any initial input, its output is considered part of a pseudorandom stream and then used as an input block to produce more output bits. Using these two ideal properties, we construct a test framework for cyptographic primitives that is shown at work on the block cipher TEA. In this way, we are able to distinguish reduced round versions of it from a random permutation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Julio César Hernández
    • 1
  • José María Sierra
    • 1
  • Arturo Ribagorda
    • 1
  • Benjamín Ramos
    • 1
  • J. C. Mex-Perera
    • 2
  1. 1.Computer Security GroupCarlos III UniversityMadridSpain
  2. 2.Cryptography & Computer Communications Security GroupBradford UniversityBradfordUK

Personalised recommendations