{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:55:40Z","timestamp":1774976140575,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642254048","type":"print"},{"value":"9783642254055","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-25405-5_16","type":"book-chapter","created":{"date-parts":[[2011,11,24]],"date-time":"2011-11-24T06:32:34Z","timestamp":1322116354000},"page":"244-254","source":"Crossref","is-referenced-by-count":18,"title":["Wild McEliece Incognito"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanja","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christiane","family":"Peters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"#cr-split#-16_CR1.1","doi-asserted-by":"crossref","unstructured":"Augot, D., Barbier, M., Couvreur, A.: List-decoding of binary Goppa codes up to the binary Johnson bound (2010), http:\/\/arxiv.org\/abs\/1012.3439;","DOI":"10.1109\/ITW.2011.6089384"},{"key":"#cr-split#-16_CR1.2","unstructured":"Citations in this document: ??2"},{"key":"#cr-split#-16_CR2.1","unstructured":"Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Designs, Codes and Cryptography 35, 63???79 (2005), MR 2006d:94038, http:\/\/www.springerlink.com\/index\/JR001118R1567U13.pdf;"},{"key":"#cr-split#-16_CR2.2","unstructured":"Citations in this document: ??1, ??3, ??3"},{"key":"16_CR3","unstructured":"Berlekamp, E.R.: Algebraic coding theory. Aegean Park Press (1984) ISBN 0894120638; Citations in this document: \u00a72"},{"key":"#cr-split#-16_CR4.1","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: List decoding for binary Goppa codes. In: IWCC [10], pp. 62???80 (2011), http:\/\/cr.yp.to\/papers.html#goppalist;","DOI":"10.1007\/978-3-642-20901-7_4"},{"key":"#cr-split#-16_CR4.2","unstructured":"Citations in this document: ??2"},{"key":"#cr-split#-16_CR5.1","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Simplified high-speed high-distance list decoding for alternant codes. In: PQCrypto 2011 [27], pp. 200???216 (2011), http:\/\/cr.yp.to\/papers.html#simplelist;","DOI":"10.1007\/978-3-642-25405-5_13"},{"key":"#cr-split#-16_CR5.2","unstructured":"Citations in this document: ??2, ??2"},{"key":"#cr-split#-16_CR6.1","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece. In: SAC 2010 [7], pp. 143???158 (2011), http:\/\/eprint.iacr.org\/2010\/410;","DOI":"10.1007\/978-3-642-19574-7_10"},{"key":"#cr-split#-16_CR6.2","unstructured":"Citations in this document: ??1, ??1, ??1, ??1, ??1, ??1, ??2, ??2, ??2, ??3, ??4, ??4"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Biryukov, A., Gong, G., Stinson, D.R. (eds.): Selected areas in cryptography\u201417th international workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, revised selected papers. Lecture Notes in Computer Science, vol. 6544. Springer, Heidelberg (2011); See [6]","DOI":"10.1007\/978-3-642-19574-7"},{"key":"#cr-split#-16_CR8.1","unstructured":"Certicom: Certicom ECC Challenge (1997), http:\/\/www.certicom.com\/images\/pdfs\/cert_ecc_challenge.pdf;"},{"key":"#cr-split#-16_CR8.2","unstructured":"Citations in this document: ??4, ??4"},{"key":"16_CR9","unstructured":"Charpin, P. (ed.): Livre des r\u00e9sum\u00e9s\u2014EUROCODE 94, Abbaye de la Bussi\u00e8re sur Ouche, France (October 1994); See [20]"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.): Coding and cryptology\u2014third international workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011, proceedings. Lecture Notes in Computer Science, vol. 6639. Springer, Heidelberg (2011); See [4]","DOI":"10.1007\/978-3-642-20901-7"},{"key":"16_CR11","first-page":"24","volume":"6","author":"V.D. Goppa","year":"1970","unstructured":"Goppa, V.D.: A new class of linear error correcting codes. Problemy Peredachi Informatsii\u00a06, 24\u201330 (1970); Citations in this document: \u00a72, \u00a72","journal-title":"Problemy Peredachi Informatsii"},{"key":"16_CR12","first-page":"41","volume":"7","author":"V.D. Goppa","year":"1971","unstructured":"Goppa, V.D.: Rational representation of codes and (L,g)-codes. Problemy Peredachi Informatsii\u00a07, 41\u201349 (1971); Citations in this document: \u00a72","journal-title":"Problemy Peredachi Informatsii"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Kim, K. (ed.): Public key cryptography: proceedings of the 4th international workshop on practice and theory in public key cryptosystems (PKC 2001) Held on Cheju Island, February 13-15, 2001. Lecture Notes in Computer Science, vol. 1992. Springer, Heidelberg (2001); See [14]","DOI":"10.1007\/3-540-44586-2"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kobara, K., Imai, H.: Semantically secure McEliece public-key cryptosystems\u2014conversions for McEliece PKC. In: PKC 2001 [13], pp. 19\u201335 (2001), MR 2003c:94027; Citations in this document: \u00a74","DOI":"10.1007\/3-540-44586-2_2"},{"key":"#cr-split#-16_CR15.1","unstructured":"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;"},{"key":"#cr-split#-16_CR15.2","unstructured":"Citations in this document: ??1"},{"key":"16_CR16","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","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, \u00a74","journal-title":"Problems of Control and Information Theory"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N.J. Patterson","year":"1975","unstructured":"Patterson, N.J.: The algebraic decoding of Goppa codes. IEEE Transactions on Information Theory\u00a021, 203\u2013207 (1975); Citations in this document: \u00a72","journal-title":"IEEE Transactions on Information Theory"},{"key":"#cr-split#-16_CR18.1","doi-asserted-by":"crossref","unstructured":"Peters, C.: Information-set decoding for linear codes over F q. In: PQCrypto 2010 [22], pp. 81???94 (2010), http:\/\/eprint.iacr.org\/2009\/589;","DOI":"10.1007\/978-3-642-12929-2_7"},{"key":"#cr-split#-16_CR18.2","unstructured":"Citations in this document: ??1, ??3, ??4, ??4, ??4, ??5"},{"key":"#cr-split#-16_CR19.1","doi-asserted-by":"crossref","unstructured":"RSA Laboratories: The RSA Factoring Challenge (1991), http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2092;","DOI":"10.1016\/0142-0496(91)90271-6"},{"key":"#cr-split#-16_CR19.2","unstructured":"Citations in this document: ??4"},{"key":"#cr-split#-16_CR20.1","unstructured":"Sendrier, N.: On the structure of a randomly permuted concatenated code. In: EUROCODE 94 [9], pp. 169???173 (1994);"},{"key":"#cr-split#-16_CR20.2","unstructured":"Citations in this document: ??3, ??3"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N. Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Transactions on Information Theory\u00a046, 1193\u20131203 (2000), MR 2001e:94017, http:\/\/hal.inria.fr\/docs\/00\/07\/30\/37\/PDF\/RR-3637.pdf ; Citations in this document: \u00a71","journal-title":"IEEE Transactions on Information Theory"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Sendrier, N. (ed.): Post-quantum cryptography, third international workshop, PQCrypto, Darmstadt, Germany, May 25-28, 2010. Lecture Notes in Computer Science, vol. 6061. Springer, Heidelberg (2010); See [18], [25]","DOI":"10.1007\/978-3-642-12929-2"},{"key":"#cr-split#-16_CR23.1","unstructured":"Stein, W. (ed.): Sage Mathematics Software (Version 4.4.3), The Sage Group (2010) http:\/\/www.sagemath.org;"},{"key":"#cr-split#-16_CR23.2","unstructured":"Citations in this document: ??4"},{"key":"16_CR24","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: \u00a72","journal-title":"IEEE Transactions on Information Theory"},{"key":"#cr-split#-16_CR25.1","doi-asserted-by":"crossref","unstructured":"Wieschebrink, C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. In: PQCrypto 2010 [22], pp. 61???72 (2010);","DOI":"10.1007\/978-3-642-12929-2_5"},{"key":"#cr-split#-16_CR25.2","unstructured":"Citations in this document: ??3"},{"key":"16_CR26","unstructured":"Wikipedia: RSA Factoring Challenge\u2014Wikipedia, The Free Encyclopedia (2011), http:\/\/en.wikipedia.org\/wiki\/RSA_Factoring_Challenge (accessed July 01, 2011); Citations in this document: \u00a74"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Yang, B.-Y. (ed): Post-quantum cryptography, fourth international workshop, PQCrypto, Taipei, Taiwan, November 29-December 02, 2011. Lecture Notes in Computer Science, vol. 7071. Springer, Heidelberg (2011); See [5]","DOI":"10.1007\/978-3-642-25405-5"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25405-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T21:08:20Z","timestamp":1560978500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25405-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642254048","9783642254055"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25405-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}