{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:52Z","timestamp":1772283532111,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642209000","type":"print"},{"value":"9783642209017","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20901-7_4","type":"book-chapter","created":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T14:11:30Z","timestamp":1307196690000},"page":"62-80","source":"Crossref","is-referenced-by-count":16,"title":["List Decoding for Binary Goppa Codes"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York (2000), ISBN 1-58113-184-4, See [8]"},{"key":"4_CR2","unstructured":"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: \u00a71"},{"key":"4_CR3","unstructured":"Avanzi, R.M.: A study on polynomials in separated variables with low genus factors, Ph.D. thesis, Universit\u00e4t Essen (2001), http:\/\/caccioppoli.mac.rub.de\/website\/papers\/phdthesis.pdf , Citations in this document: \u00a76"},{"key":"4_CR4","unstructured":"Bernstein, D.J.: Fast multiplication and its applications. In: [11], pp. 325\u2013384 (2008), http:\/\/cr.yp.to\/papers.html#multapps , Citations in this document: \u00a71"},{"key":"4_CR5","unstructured":"Bernstein, D.J.: Reducing lattice bases to find small-height values of univariate polynomials. In: [11], pp. 421\u2013446 (2008), http:\/\/cr.yp.to\/papers.html#smallheight , Citations in this document: \u00a73, \u00a73, \u00a73, \u00a73, \u00a77"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: [10], pp. 31\u201346 (2008), http:\/\/cr.yp.to\/papers.html#mceliece , Citations in this document: \u00a71, \u00a74","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-19574-7_10","volume-title":"Selected Areas in Cryptography","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 143\u2013158. Springer, Heidelberg (2011), Citations in this document: x1, x4"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D.: Finding smooth integers in short intervals using CRT decoding. In: [1], pp. 265\u2013272 (2000); see also newer version [9], Citations in this document: \u00a72","DOI":"10.1145\/335305.335337"},{"key":"4_CR9","unstructured":"Boneh, D.: Finding smooth integers in short intervals using CRT decoding. Journal of Computer and System Sciences\u00a064, 768\u2013784 (2002), http:\/\/crypto.stanford.edu\/~dabo\/abstracts\/CRTdecode.html ; see also older version [8], ISSN 0022-0000, MR 1 912 302"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Post-Quantum Cryptography","year":"2008","unstructured":"Buchmann, J., Ding, J. (eds.): PQCrypto 2008. LNCS, vol.\u00a05299. Springer, Heidelberg (2008), See [6]"},{"key":"4_CR11","series-title":"Mathematical Sciences Research Institute Publications","volume-title":"Surveys in algorithmic number theory","year":"2008","unstructured":"Buhler, J.P., Stevenhagen, P. (eds.): Surveys in algorithmic number theory. Mathematical Sciences Research Institute Publications, vol.\u00a044. Cambridge University Press, New York (2008), See [4], [5]"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Joux, A., Laguillaumie, F., Nguyen, P.Q.: Factoring pq2 with quadratic forms: nice cryptanalyses. In: [23], pp. 469\u2013486 (2009), Citations in this document: x3","DOI":"10.1007\/978-3-642-10366-7_28"},{"key":"4_CR13","unstructured":"Cohn, H., Heninger, N.: Ideal forms of Coppersmith\u2019s theorem and Guruswami-Sudan list decoding (2010), http:\/\/arxiv.org\/abs\/1008.1284 , Citations in this document: \u00a73"},{"key":"4_CR14","unstructured":"Coppersmith, D., Howgrave-Graham, N., Nagaraj, S.V.: Divisors in residue classes, constructively (2004), http:\/\/eprint.iacr.org\/2004\/339 , see also newer version [15]"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Howgrave-Graham, N., Nagaraj, S.V.: Divisors in residue classes, constructively. Mathematics of Computation\u00a077, 531\u2013545 (2008); see also older version [15], Citations in this document: \u00a72","DOI":"10.1090\/S0025-5718-07-02007-8"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Ne\u0161et\u0159il, J. (eds.): The mathematics of Paul Erd\u00f6s. I. Algorithms and Combinatorics, vol.\u00a013. Springer, Berlin (1997), ISBN 3-540-61032-4, MR 97f:00032, See [20]","DOI":"10.1007\/978-3-642-60406-5_1"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Transactions on Information Theory\u00a045, 1757\u20131767 (1999), http:\/\/theory.lcs.mit.edu\/~madhu\/bib.html , ISSN 0018-9448, MR 2000j:94033, Citations in this document: \u00a71, \u00a71","DOI":"10.1109\/18.782097"},{"key":"4_CR18","unstructured":"Guruswami, V.: List decoding of error-correcting codes, Ph.D. thesis, Massachusetts Institute of Technology (2001), Citations in this document: \u00a71"},{"key":"4_CR19","unstructured":"Howgrave-Graham, N.: Computational mathematics inspired by RSA, Ph.D. thesis (1998), http:\/\/cr.yp.to\/bib\/entries.html#1998\/howgrave-graham , Citations in this document: \u00a72"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Konyagin, S., Pomerance, C.: On primes recognizable in deterministic polynomial time. In: [16], pp. 176\u2013198 (1997), http:\/\/cr.yp.to\/bib\/entries.html#1997\/konyagin , MR 98a:11184, Citations in this document: \u00a72","DOI":"10.1007\/978-3-642-60408-9_15"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K.: Factoring multivariate polynomials over finite fields. Journal of Computer and System Sciences\u00a030, 235\u2013248 (1985), MR 87a:11124, Citations in this document: \u00a72","DOI":"10.1016\/0022-0000(85)90016-9"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Lenstra Jr., H.W.: Divisors in residue classes. Mathematics of Computation\u00a042, 331\u2013340 (1984), http:\/\/www.jstor.org\/sici?sici=0025-5718(198401)42:165<331:DIRC>2.0.CO;2-6,ISSN 0025-5718, MR 85b:11118, Citations in this document: \u00a72","DOI":"10.1090\/S0025-5718-1984-0726007-1"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","year":"2009","unstructured":"Matsui, M. (ed.): ASIACRYPT 2009. LNCS, vol.\u00a05912. Springer, Heidelberg (2009), See [12]"},{"key":"4_CR24","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, 114\u2013116 (1978), http:\/\/ipnpr.jpl.nasa.gov\/progress_report2\/42-44\/44N.PDF , Citations in this document: \u00a71"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0747-7171(02)00139-6","volume":"35","author":"T. Mulders","year":"2003","unstructured":"Mulders, T., Storjohann, A.: On lattice reduction for polynomial matrices. Journal of Symbolic Computation\u00a035, 377\u2013401 (2003), Citations in this document: \u00a72","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR26","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory\u00a015, 159\u2013166 (1986), Citations in this document: \u00a71"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Patterson, N.J.: The algebraic decoding of Goppa codes. IEEE Transactions on Information Theory\u00a021, 203\u2013207 (1975), Citations in this document: \u00a71","DOI":"10.1109\/TIT.1975.1055350"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TIT.1976.1055610","volume":"22","author":"Y. Sugiyama","year":"1976","unstructured":"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\u00a022, 518\u2013526 (1976), Citations in this document: \u00a71, \u00a71","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Wu, Y.: New list decoding algorithms for Reed\u2013Solomon and BCH codes. IEEE Transactions On Information Theory\u00a054 (2008), http:\/\/arxiv.org\/abs\/cs\/0703105 , Citations in this document: \u00a71","DOI":"10.1109\/TIT.2008.926355"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20901-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T16:25:45Z","timestamp":1637771145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20901-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642209000","9783642209017"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20901-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}