This paper presents the results of the best differential characteristic search of FEAL. The search algorithm for the best differential characteristic (best linear expression) was already presented by Matsui, and improvements on this algorithm were presented by Moriai et al. We further improve the speed of the search algorithm. For example, the search time for the 7-round best differential characteristic of FEAL is reduced to about 10 minutes (Pentium/166 MHz), which is about 2 12.6 times faster than Matsui's algorithm. Moreover, we determine all the best differential characteristics of FEAL for up to 32 rounds assuming all S-boxes are independent. As a result, we confirm that the N-round (7 < N <32) best differential characteristic probability of FEAL is 2 -2N , which was found by Biham. For N = 6, we find 6-round differential characteristics with a greater probability, 2 -11 , than that previously discovered, 2 -12 .
[1]
Shoji Miyaguchi,et al.
Fast Data Encipherment Algorithm FEAL
,
1987,
EUROCRYPT.
[2]
Xuejia Lai,et al.
Markov Ciphers and Differential Cryptanalysis
,
1991,
EUROCRYPT.
[3]
Serge Vaudenay,et al.
Links Between Differential and Linear Cryptanalysis
,
1994,
EUROCRYPT.
[4]
Kwangjo Kim,et al.
An Efficient Method to Find the Linear Expressions for Linear Cryptanalysis
,
1995
.
[5]
Kazuo Ohta,et al.
The best linear expression search of FEAL
,
1996
.
[6]
Mitsuru Matsui,et al.
On Correlation Between the Order of S-boxes and the Strength of DES
,
1994,
EUROCRYPT.
[7]
Eli Biham,et al.
Differential Cryptanalysis of the Data Encryption Standard
,
1993,
Springer New York.
[8]
Mitsuru Matsui,et al.
Linear Cryptanalysis of LOKI and s2DES
,
1994,
ASIACRYPT.