Title
Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers
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.
Year
DOI
Venue
2001
10.1007/3-540-45325-3_34
IMA Int. Conf.
Keywords
Field
DocType
hash function,statistical test,block cipher,random permutation
Discrete mathematics,Block cipher,Computer science,Permutation,Arithmetic,Random permutation,Hash function,Pseudorandom permutation,Random number generation,Pseudorandom number generator,Random function
Conference
ISBN
Citations 
PageRank 
3-540-43026-1
1
0.41
References 
Authors
1
5