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

Authors:
Aggelos Kiayias;Moti Yung
Affiliations:
Computer Science and Eng. Dept., University of Connecticut, Storrs, USA;Computer Science Dept., Columbia University, New york, USA
Venue:
Designs, Codes and Cryptography
Year:
2007

Citing 5
Cited 0

Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A public key encryption scheme based on the polynomial reconstruction problem

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.