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:
“It is well worth the efforts of a lifetime to have attained knowledge which justifies an attack on the root of all evil—viz. the deadly atheism which asserts that because forms of evil have always existed in society, therefore they must always exist; and that the attainment of a high ideal is a hopeless chimera.”
—Elizabeth Blackwell (1821–1910)