List decoding for binary goppa codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6639 LNCS, Issue , 2011, Pages 62-80

  Bernstein, Daniel J ^a  

^a University of Illinois at Chicago   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GOPPA CODES; LIST-DECODING; POLYNOMIAL-TIME;

ALGORITHMS; CRYPTOGRAPHY; ERRORS; POLYNOMIAL APPROXIMATION;

DECODING;

EID: 79959294715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20901-7_4     Document Type: Conference Paper

References (29)

1. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York (2000), ISBN 1-58113-184-4, See [8]
2. Augot, D., Barbier, M., Couvreur, A.: List-decoding of binary Goppa codes up to the binary Johnson bound, http://arxiv.org/abs/1012.3439, Citations in this document: §1
3. Avanzi, R.M.: A study on polynomials in separated variables with low genus factors, Ph.D. thesis, Universiẗat Essen (2001), http://caccioppoli. mac.rub.de/website/papers/phdthesis.pdf, Citations in this document: §6
4. Bernstein, D.J.: Fast multiplication and its applications. In: [11], pp. 325-384 (2008), http://cr.yp.to/papers.html#multapps, Citations in this document: §1
5. Bernstein, D.J.: Reducing lattice bases to find small-height values of univariate polynomials. In: [11], pp. 421-446 (2008), http://cr.yp.to/papers. html#smallheight, Citations in this document: §3, §3, §3, §3, §7
6. Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryp-tosystem. In: [10], pp. 31-46 (2008), http://cr.yp.to/papers. html#mceliece, Citations in this document: §1, §4
7. Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 143-158. Springer, Heidelberg (2011), Citations in this document: §1, §4
8. Boneh, D.: Finding smooth integers in short intervals using CRT decoding. In: [1], pp. 265-272 (2000);
9. Boneh, D.: Finding smooth integers in short intervals using CRT decoding. Journal of Computer and System Sciences 64, 768-784 (2002), http://crypto.stanford.edu/∼dabo/abstracts/CRTdecode.html; (Pubitemid 41161935)
10. Buchmann, J., Ding, J. (eds.): PQCrypto 2008. LNCS, vol. 5299. Springer, Heidelberg (2008).
11. Buhler, J.P., Stevenhagen, P. (eds.): Surveys in algorithmic number theory. Mathematical Sciences Research Institute Publications, vol. 44. Cambridge University Press, New York (2008).
12. 2 with quadratic forms: nice cryptanalyses. In: [23], pp. 469-486 (2009).
13. Cohn, H., Heninger, N.: Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (2010), http://arxiv.org/abs/1008.1284.
14. Coppersmith, D., Howgrave-Graham, N., Nagaraj, S.V.: Divisors in residue classes, constructively (2004), http://eprint.iacr.org/2004/339.
15. Coppersmith, D., Howgrave-Graham, N., Nagaraj, S.V.: Divisors in residue classes, constructively. Mathematics of Computation 77, 531-545 (2008);
16. Graham, R.L., Nesetril, J. (eds.): The mathematics of Paul Erd̈os. I. Algorithms and Combinatorics, vol. 13. Springer, Berlin (1997), ISBN 3-540-61032-4, MR 97f:00032.
17. Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Transactions on Information Theory 45, 1757-1767 (1999), http://theory.lcs.mit.edu/∼madhu/bib.html, ISSN 0018-9448, MR 2000j:94033. (Pubitemid 32871911)
18. Guruswami, V.: List decoding of error-correcting codes, Ph.D. thesis, Massachusetts Institute of Technology (2001).
19. Howgrave-Graham, N.: Computational mathematics inspired by RSA, Ph.D. thesis (1998), http://cr.yp.to/bib/entries.html#1998/howgrave-graham.
20. Konyagin, S., Pomerance, C.: On primes recognizable in deterministic polynomial time. In: [16], pp. 176-198 (1997), http://cr.yp.to/bib/entries. html#1997/konyagin, MR 98a:11184.
21. Lenstra, A.K.: Factoring multivariate polynomials over finite fields. Journal of Computer and System Sciences 30, 235-248 (1985), MR 87a:11124.
22. Lenstra Jr., H.W.: Divisors in residue classes. Mathematics of Computation 42, 331-340 (1984), http://www.jstor.org/sici?sici=0025-5718(198401) 42: 1652.0.CO;331:DIRC2-6, ISSN 0025-5718, MR 85b:11118.
23. Matsui, M. (ed.): ASIACRYPT 2009. LNCS, vol. 5912. Springer, Heidelberg (2009).
24. McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, 114-116 (1978), http://ipnpr.jpl.nasa.gov/ progress-report2/42-44/44N.PDF.
25. Mulders, T., Storjohann, A.: On lattice reduction for polynomial matrices. Journal of Symbolic Computation 35, 377-401 (2003). (Pubitemid 36530121)
26. Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory 15, 159-166 (1986). (Pubitemid 16608352)
27. Patterson, N.J.: The algebraic decoding of Goppa codes. IEEE Transactions on Information Theory 21, 203-207 (1975).
28. Sugiyama, Y., Kasahara, M., Hirasawa, S., Namekawa, T.: Further results on Goppa codes and their applications to constructing efficient binary codes. IEEE Transactions on Information Theory 22, 518-526 (1976).
29. Wu, Y.: New list decoding algorithms for Reed-Solomon and BCH codes. IEEE Transactions On Information Theory 54 (2008), http://arxiv.org/abs/cs/0703105.