In cryptography, an interpolation attack is a type of cryptanalytic attack against block ciphers.
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.
Famous quotes containing the word attack:
“A great deal of unnecessary worry is indulged in by theatregoers trying to understand what Bernard Shaw means. They are not satisfied to listen to a pleasantly written scene in which three or four clever people say clever things, but they need to purse their lips and scowl a little and debate as to whether Shaw meant the lines to be an attack on monogamy as an institution or a plea for manual training in the public school system.”
—Robert Benchley (1889–1945)