论文信息 - Root Finding Interpolation Attack

Root Finding Interpolation Attack

In this paper, we first show that there are several equivalent keys for t + 1 chosen plaintexts if the degree of the reduced cipher is t-1. This is against the claim by Jakobsen and Knudsen. We also derive an upper bound on the number of equivalent last round keys for t + 1 chosen plaintexts. We further show an efficient method which finds all the equivalent keys by using Rabin's root finding algorithm. We call our attack root finding interpolation attack.

Kaoru Kurosawa | Tetsu Iwata | Quang Viet Duong

[1] Toshinobu Kaneko,et al. Higher Order Differential Attak of CAST Cipher , 1998, FSE.

[2] Amr M. Youssef,et al. On the Interpolation Attacks on Block Ciphers , 2000, FSE.

[3] E. Berlekamp. Factoring polynomials over large finite fields* , 1970, SYMSAC '71.

[4] Eli Biham,et al. Differential Cryptanalysis of the Data Encryption Standard , 1993, Springer New York.

[5] Lars R. Knudsen,et al. Provable Security Against a Differential Attack , 1994 .

[6] Lars R. Knudsen,et al. The Interpolation Attack on Block Ciphers , 1997, FSE.

[7] Michael O. Rabin,et al. Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..

[8] S. Moriai,et al. Higher order differential attack of a CAST cipher , 1998 .

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

[10] Thomas Jakobson,et al. Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree , 1998, CRYPTO.

[11] Richard Zippel,et al. Effective polynomial computation , 1993, The Kluwer international series in engineering and computer science.

[12] Gerhard Goos,et al. Fast Software Encryption , 2001, Lecture Notes in Computer Science.