论文信息 - On sharing secrets and Reed-Solomon codes

On sharing secrets and Reed-Solomon codes

Shamir's scheme for sharing secrets is closely related to Reed-Solomon coding schemes. Decoding algorithms for Reed-Solomon codes provide extensions and generalizations of Shamir's method.

R. J. McEliece | D. V. Sarwate | R. McEliece | D. Sarwate

[1] Vincent Y. Lum,et al. General performance analysis of key-to-address transformation methods using an abstract file concept , 1973, CACM.

[2] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[3] Robert J. McEliece,et al. The Theory of Information and Coding , 1979 .

[4] W. W. Peterson,et al. Addressing for Random-Access Storage , 1957, IBM J. Res. Dev..

[5] Masao Kasahara,et al. An erasures-and-errors decoding algorithm for Goppa codes (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[6] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[7] Dilip V. Sarwate. On the complexity of decoding goppa codes , 1977 .

[8] Adi Shamir,et al. How to share a secret , 1979, CACM.

[9] J. P. Tremblay,et al. Key-To-Address Transformation Techniques , 1978 .

[10] Masao Kasahara,et al. Review of ́On Measures of Information and Their Characterizationś (Aczél, J., and Daróczy, Z.; 1975) , 1976, IEEE Transactions on Information Theory.

[11] Páe Quittner,et al. Comparison of different disk searching methods , 1978, Softw. Pract. Exp..

[12] Dilip V. Sarwate. On the complexity of decoding Goppa codes (Corresp.) , 1977, IEEE Trans. Inf. Theory.