Cryptology ePrint Archive: Report 2004/217

Cryptanalyzing the Polynomial-Reconstruction based Public-Key System Under Optimal Parameter Choice

Aggelos Kiayias and Moti Yung

Abstract: 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.

Category / Keywords: public-key cryptography / cryptanalysis

Publication Info: extended version of abstract that appears in Asiacrypt '04

Date: received 31 Aug 2004

Contact author: aggelos at cse uconn edu

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20040901:124657 (All versions of this report)

Short URL: ia.cr/2004/217

Discussion forum: Show discussion | Start new discussion