Sciweavers

31 search results - page 7 / 7
» Synthesizing Converters Between Finite State Protocols
Sort
View
TIT
2008
164views more  TIT 2008»
13 years 5 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung