Polynomial Reconstruction Based Cryptography [chapter]

Aggelos Kiayias, Moti Yung
2001 Lecture Notes in Computer Science  
Cryptography and Coding Theory are closely knitted in many respects. Recently, the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) was suggested as an intractability assumption upon which the security of cryptographic protocols can be based. This has initiated a line of research that exploited the rich algebraic structure of the problem and related subproblems of which in the cryptographic setting. Here we give a short overview of recent works on the subject and the novel
more » ... applications that were enabled due to this development.
doi:10.1007/3-540-45537-x_10 fatcat:r7piimz3jbg23eaqk4npb6yjwq