In the attack, an algebraic function is used to represent an S-box. This may be a simple quadratic, or a polynomial or rational function over a Galois field. Its coefficients can be determined by standard Lagrange interpolation techniques, using known plaintexts as data points. Alternatively, chosen plaintexts can be used to simplify the equations and optimize the attack.
Thomas Jakobsen introduced a probabilistic version of the interpolation attack using Madhu Sudan's algorithm for improved decoding of Reed-Solomon codes. This attack can work even when an algebraic relationship between plaintexts and ciphertexts holds for only a fraction of values.
- Thomas Jakobsen, Lars Knudsen (January 1997). "The Interpolation Attack on Block Ciphers" (PDF/PostScript). 4th International Workshop on Fast Software Encryption (FSE '97), LNCS 1267. Haifa: Springer-Verlag. pp. pp.28–40. Retrieved 2007-07-03.
- Thomas Jakobsen (August 25, 1998). "Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree" (PDF/PostScript). Advances in Cryptology — CRYPTO '98. Santa Barbara, California: Springer-Verlag. pp. pp.212–222. Retrieved 2007-07-06. (Video of presentation at Google Video—uses Flash)
- Shiho Moriai, Takeshi Shimoyama, Toshinobu Kaneko (March 1999). "Interpolation Attacks of the Block Cipher: SNAKE" (PDF). FSE '99. Rome: Springer-Verlag. pp. pp.275–289. Retrieved 2007-09-16.
- Amr M. Youssef, Guang Gong (April 2000). "On the Interpolation Attacks on Block Ciphers" (PDF). FSE 2000. New York City: Springer-Verlag. pp. pp.109–120. Retrieved 2007-07-06.
- Kaoru Kurosawa, Tetsu Iwata, Viet Duong Quang (August 2000). "Root Finding Interpolation Attack" (PDF/PostScript). Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography (SAC 2000). Waterloo, Ontario: Springer-Verlag. pp. pp.303–314. Retrieved 2007-07-06.
|This cryptography-related article is a stub. You can help Wikipedia by expanding it.|