Cryptography and Decoding Reed-Solomon Codes as a Hard Problem (Invited Paper)
Aggelos Kiayias, Moti M. Yung · 2005
Some recent developments in employing Reed- Solomon Codes in Cryptography are surveyed, including the de- sign of symmetric ciphers and what provable properties one can argue based on suitable hardness assumptions (for parameters where decoding is hard).