Recently, Augot and Finiasz presented a coding theoretic public key cryptosystem that suggests a new approach for designing such systems based on the Polynomial Reconstruction Problem. Their cryptosystem is an instantiation of this approach under a specific choice of parameters which, given the state of the art of coding theory, we show in this work to be sub-optimal. Coron showed how to attack the Augot and Finiasz cryptosystem. A question left open is whether the general approach suggested by the cryptosystem works or not. In this work, we show that the general approach (rather than only the instantiation) is broken as well. Our attack employs the recent powerful list-decoding mechanisms. © International Association for Cryptologic Research 2004.
CITATION STYLE
Kiayias, A., & Yung, M. (2004). Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3329, 401–416. https://doi.org/10.1007/978-3-540-30539-2_28
Mendeley helps you to discover research relevant for your work.