{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:55:31Z","timestamp":1764996931009,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642254048"},{"type":"electronic","value":"9783642254055"}],"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_14","type":"book-chapter","created":{"date-parts":[[2011,11,24]],"date-time":"2011-11-24T11:32:34Z","timestamp":1322134354000},"page":"217-227","source":"Crossref","is-referenced-by-count":3,"title":["Statistical Decoding of Codes over $\\mathbb{F}_q$"],"prefix":"10.1007","author":[{"given":"Robert","family":"Niebuhr","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11554868_6","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"D. Augot","year":"2005","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A Family of Fast Syndrome Based Cryptographic Hash Functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 64\u201383. Springer, Heidelberg (2005); Cited on page 7"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"T.P. Berger","year":"2009","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing Key Length of the McEliece Cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol.\u00a05580, pp. 77\u201397. Springer, Heidelberg (2009); Cited on page 6"},{"key":"14_CR3","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Ball-collision decoding. Cryptology ePrint Archive, Report 2010\/585 (2010), http:\/\/eprint.iacr.org\/2010\/585.pdf ; Cited on page 1"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C., Schwabe, P.: Faster 2-regular information-set decoding. Cryptology ePrint Archive, Report 2011\/120 (2011), http:\/\/eprint.iacr.org\/ ; Cited on page 7","DOI":"10.1007\/978-3-642-20901-7_5"},{"key":"14_CR5","unstructured":"Cayrel, P.-L., V\u00e9ron, P., El Yousfi Alaoui, S.M.: Improved code-based identification scheme. In: SAC 2010 (2010), http:\/\/arxiv.org\/abs\/1001.3017v1 ; Cited on page 6"},{"key":"14_CR6","unstructured":"Cheung, K.-M.: The weight distribution and randomness of linear codes. TDA Progress Report 42\u201397, Communications Systems Research Section (1989); Cited on page 7"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45325-3_1","volume-title":"Cryptography and Coding","author":"A. Al Jabri","year":"2001","unstructured":"Al Jabri, A.: A Statistical Decoding Algorithm for General Linear Block Codes. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol.\u00a02260, pp. 1\u20138. Springer, Heidelberg (2001); Cited on page 1"},{"key":"14_CR8","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-Holland Mathematical Library, vol.\u00a016 (1977); Cited on page 7"},{"key":"14_CR9","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DNS Progress Report, pp. 114\u2013116 (1978); Cited on page 1"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Minder, L., Sinclair, A.: The extended k-tree algorithm. In: SODA, pp. 586\u2013595 (2009); Cited on page 1","DOI":"10.1137\/1.9781611973068.65"},{"key":"#cr-split#-14_CR11.1","unstructured":"Niebuhr, R., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On lower bounds for Information Set Decoding over $\\mathbb{F}_{q}$ . In: SCC 2010, RHUL, London, UK, pp. 143-158 (2010);"},{"key":"#cr-split#-14_CR11.2","unstructured":"Cited on page 1 and 9"},{"key":"14_CR12","unstructured":"Niebuhr, R., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On lower bounds for Information Set Decoding over $\\mathbb{F}_{q}$ . and on the effect of Partial Knowledge. Submitted to Math in CS, SCC 2010 (2011); Cited on page 9"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11780656_24","volume-title":"Information Security and Privacy","author":"R. Overbeck","year":"2006","unstructured":"Overbeck, R.: Statistical Decoding Revisited. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol.\u00a04058, pp. 283\u2013294. Springer, Heidelberg (2006); Cited on page 1, 7 and 10"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","volume-title":"Post-Quantum Cryptography","author":"C. Peters","year":"2010","unstructured":"Peters, C.: Information-set decoding for linear codes over $\\mathbb{F}_{q}$ . In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 81\u201394. Springer, Heidelberg (2010); Cited on page 9"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Transactions on Information Theory, 5\u20139 (1962); Cited on page 9","DOI":"10.1109\/TIT.1962.1057777"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring, pp. 124\u2013134. IEEE Press (1994); Cited on page 1","DOI":"10.1109\/SFCS.1994.365700"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T12:27:34Z","timestamp":1741955254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25405-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642254048","9783642254055"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25405-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}