Thomas Jakobson

Learn More
Using recent results from coding theory, it is shown how to break block ciphers operating on GF(q) where the ciphertext is express-ible as evaluations of an unknown univariate polynomial of low degree m over the plaintext with a typically low but non-negligible probability. The method employed is essentially Sudan's algorithm for decoding Reed-Solomon codes(More)
  • 1