Cryptography and decoding reed-solomon codes as a hard problem
Aggelos Kiayias, Moti M. Yung · 2005
Some recent developments in employing Reed-Solomon codes in cryptography are surveyed, including the design of symmetric ciphers and what provable properties one can argue based on suitable hardness assumptions (for parameters where decoding is hard).