Root finding interpolation attack

DOI10.1007/3-540-44983-3_22MaRDI QIDQ2762763zbMATH OpenFDO

Authors Kaoru Kurosawa, Tetsu Iwata, Viet Duong Quang

Publication date 9 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2012/20120303

zbMATH Keywords

Block cipherinterpolation attackresultantroot finding algorithm

Mathematics Subject Classification ID

Cryptography (94A60)

Review text

In this paper, we first show that there are \textit{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 \textit{root finding interpolation attack}. For the entire collection see [Zbl 0961.00038].

Recommendations

• The interpolation attack on block ciphers
• Attacks on block ciphers of low algebraic degree
• Interpolation attacks of the block cipher: SNAKE
• Cryptanalysis of block ciphers with probabilistic nonlinear relations of low degree
• On the interpolation attacks on block ciphers

This page was built for publication: Root finding interpolation attack

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762763)