You are looking at a specific version 20030306:075436 of this paper. See the latest version.

Paper 2003/036

Cryptanalysis of a public-key encryption scheme based on the polynomial reconstruction problem

Jean-Sebastien Coron

Abstract

We describe a cryptanalysis of a public-key encryption scheme based on the polynomial reconstruction problem. Given the public-key and a ciphertext, we recover the corresponding plaintext in polynomial time. Therefore, the scheme is not one-way. Our technique is a variant of the Berlekamp-Welsh algorithm.

Note: The attack is now proven (in the previous version, the attack was heuristic).

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Error-correcting codes.
Contact author(s)
coron @ clipper ens fr
History
2003-03-06: revised
2003-02-23: received
See all versions
Short URL
https://ia.cr/2003/036
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.