Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Aggelos Kiayias:

TR02-017 | 12th March 2002
Aggelos Kiayias, Moti Yung

Cryptographic Hardness based on the Decoding of Reed-Solomon Codes with Applications

We investigate the decoding problem of Reed-Solomon Codes (aka: the Polynomial Reconstruction Problem -- PR) from a cryptographic hardness perspective. First, following the standard methodology for constructing cryptographically strong primitives, we formulate a decisional intractability assumption related to the PR problem. Then, based on this assumption we show: (i) hardness ... more >>>

ISSN 1433-8092 | Imprint