Abstract

Differential cryptanalysis is a method of attacking iterated mappings based on differences known as characteristics. The probability of a given characteristic is derived from the XOR tables associated with the iterated mapping. If ß is a mapping ß : Z m 2 ! Z m 2 , then for each \DeltaX; \DeltaY 2 Z m 2 the XOR table for ß gives the number of input pairs of difference \DeltaX = X+X 0 for which ß(X)+ß(X 0 ) = \DeltaY . The complexity of a differential attack depends upon two properties of the XOR tables: the density of zero entries in the table, and the size of the largest entry in the table. In this paper we present the first results on the expected values of these properties for a general class of mappings ß. We prove that if ß : Z m 2 ! Z m 2 is a bijective mapping then the expected size of the largest entry in the XOR table for ß is bounded by 2m, while the fraction of the XOR table that is zero approaches e \Gamma 1 2 = 0:60653. We are then able to demonstrate tha...

Citations

407	Differential Cryptanalysis of DES-like Cryptosystems - Biham, Shamir - 1990
76	Differential Cryptanalysis of the Full 16-Round DES - Biham, Shamir - 1993
52	LOKI-a cryptographic primitive for authentication and secrecy applications - Brown, Pieprzyk, et al. - 1990
40	Improving resistance to differential cryptanalysis and the redesign of LOKI - Brown, Kwan, et al. - 1993
26	Differential Cryptanalysis of Snefru - Biham, Shamir - 1992
12	On immunity against Biham and Shamir’s differential cryptanalysis - Adams - 1992
1	On almost perfect nonlinear permutations. abstracts of papers, EUROCRYPT 93 - Beth, Ding