论文信息 - Linear Cryptanalysis of the Fast Data Encipherment Algorithm

Linear Cryptanalysis of the Fast Data Encipherment Algorithm

This paper discusses the security of the Fast Data Encipherment Algorithm (FEAL) against Linear Cryptanalysis. It has been confirmed that the entire subkeys used in FEAL-8 can be derived with 225 pairs of known plaintexts and ciphertexts with a success rate approximately 70% spending about 1 hour using a WS (SPARCstation 10 Model 30). This paper also evaluates the security of FEAL-N in comparison with that of the Data Encryption Standard (DES).

Kazuo Ohta | Kazumaro Aoki | Kazumaro Aoki | K. Ohta

[1] Mitsuru Matsui,et al. On Correlation Between the Order of S-boxes and the Strength of DES , 1994, EUROCRYPT.

[2] A. Shimizu,et al. Fast data encipherment algorithm FEAL-8 , 1978 .

[3] Mitsuru Matsui,et al. A New Method for Known Plaintext Attack of FEAL Cipher , 1992, EUROCRYPT.

[4] Eli Biham,et al. On Matsui's Linear Cryptanalysis , 1994, EUROCRYPT.

[5] Henri Gilbert,et al. A Known Plaintext Attack of FEAL-4 and FEAL-6 , 1991, CRYPTO.

[6] Mitsuru Matsui,et al. Linear Cryptanalysis Method for DES Cipher , 1994, EUROCRYPT.