Abstract
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
Chapter PDF
Similar content being viewed by others
References
E.R. Berlekamp. Factoring polynomials over large finite fields. In Math. Comput., vol. 24, pp. 713–735, 1970.
E. Biham and A. Shamir. Differential Cryptanalysis of the Data Encryption Standard. Springer-Verlag, 1993.
T. Jakobsen. Cryptanalysis of block ciphers with probabilistic non-linear relations of low degree. In Advances in Cryptology — CRYPTO’98 Proceedings, volume 1462 of Lecture Notes in Computer Science, pages 212–222, Springer-Verlag, 1998.
T. Jakobsen and L.R. Knudsen. The interpolation attack on block ciphers. In Fast Software Encryption, volume 1267 of Lecture Notes in Computer Science, pages 28–40, Springer-Verlag, January 1997.
M. Matsui. Linear cryptanalysis method for DES cipher. In Advances in Cryptology — EUROCRYPT’93 Proceedings, volume 765 of Lecture Notes in Computer Science, pages 386–397, Springer-Verlag, 1993.
S. Moriai, T. Shimoyama and T. Kaneko. Higher order differential attack of a CAST cipher. Proc. of FSE ’98, LNCS 1372, pp.17–32, (1998)
K. Nyberg and L.R. Knudsen. Provable security against a differential attack. In Journal of Cryptology, volume 8, number 1, pages 27–37, Winter 1995.
M. Rabin. Probabilistic algorithms in finite fields. SIAM Journal on Computing, vol.9, no.2, pp.273–280 (1980)
A.M. Youssef and G. Gong. On the interpolation attacks on block ciphers. Preproc. of FSE 2000, (2000)
R. Zippel. Effective polynomial computation. Kluwer Academic Publishers (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K., Iwata, T., Duong Quang, V. (2001). Root Finding Interpolation Attack. In: Stinson, D.R., Tavares, S. (eds) Selected Areas in Cryptography. SAC 2000. Lecture Notes in Computer Science, vol 2012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44983-3_22
Download citation
DOI: https://doi.org/10.1007/3-540-44983-3_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42069-9
Online ISBN: 978-3-540-44983-6
eBook Packages: Springer Book Archive