2001 | OriginalPaper | Buchkapitel
Root Finding Interpolation Attack
verfasst von : Kaoru Kurosawa, Tetsu Iwata, Viet Duong Quang
Erschienen in: Selected Areas in Cryptography
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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