1 |
V. Guruswami, M. Sudan, 'Improved Decoding of Reed-Solomon and Algeb raic Geometry Codes', IEEE Trans. Info. Theory 45(6), pp. 1757-1767, 1999
DOI
ScienceOn
|
2 |
A. Kiayias, M. Yung, 'Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice', Asiacrypt 2004, LNCS 3329, pp. 401-416, 2003
|
3 |
H. Niederreiter, 'Knapsack-type encryption scheme and algebraic coding theory', Problems of Control and Information Theory 15(2), pp. 159-166, 1986
|
4 |
D. Augot, M. Finiasz 'A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem', Eurocrypt 2003, LNCS 2656, pp. 229-240, 2003
|
5 |
S. Gao, M. Shokrollahi, 'Computing Roots of Polynomials over Function Fields of Curves', Proceedings of the Annapolis Conference on Number Theory, Coding Theory, and Cryptography, Springer, pp. 214-228, 1999
|
6 |
J.-S. Coron, 'Cryptanalysis of a public-key encryption scheme based on the polynomial reconstruction problem', PKC 2004, LNCS 2947, pp. 14-27, 2004
|
7 |
R. McEliece, 'The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes,' IPN Progress Report, Caltech, pp. 42-153
|
8 |
I. Blake, C. Heegard, T. Hoholdt, V. Wei, 'Algebraic Codes', IEEE Trans. Info. Theory 44(6), pp. 2596-2618, 1998
DOI
ScienceOn
|
9 |
R. McEliece, 'A Public-Key Encryption Scheme based on Algebraic Coding Theory,' DSN Progress Report, Caltech, pp. 114-116, 1978
|