Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice

In Eurocrypt 2004 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 (PR). 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.

[1]  Daniel Augot,et al.  A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem , 2003, EUROCRYPT.

[2]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[3]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[4]  Aggelos Kiayias,et al.  Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes , 2002, IEEE Transactions on Information Theory.

[5]  Jean-Sébastien Coron Cryptanalysis of the Repaired Public-key Encryption Scheme Based on the Polynomial Reconstruction Problem , 2003, IACR Cryptol. ePrint Arch..

[6]  Vasek Chvátal,et al.  The tail of the hypergeometric distribution , 1979, Discret. Math..

[7]  Jean-Sébastien Coron Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem , 2004, Public Key Cryptography.

[8]  Daniel Augot,et al.  Using the Trace Operator to repair the Polynomial Reconstruction based Cryptosystem presented at Eurocrypt 2003 , 2003, IACR Cryptol. ePrint Arch..

[9]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[10]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[11]  R. McEliece The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes , 2003 .

[12]  Aggelos Kiayias,et al.  Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice , 2004, ASIACRYPT.

[13]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.