{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T02:52:10Z","timestamp":1767495130447,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319555881"},{"type":"electronic","value":"9783319555898"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55589-8_7","type":"book-chapter","created":{"date-parts":[[2017,3,7]],"date-time":"2017-03-07T21:01:24Z","timestamp":1488920484000},"page":"96-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\\mathbb {F}_q$$"],"prefix":"10.1007","author":[{"given":"Cheikh Thi\u00e9coumba","family":"Gueye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean Belo","family":"Klamti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoichi","family":"Hirose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,9]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Nguyen, H.L., Razenshteyn, I.: Beyond locality-sensitive hashing. In: SODA, pp. 1018\u20131028 (2014)","DOI":"10.1137\/1.9781611973402.76"},{"key":"7_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":"TP 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. 5580, pp. 77\u201397. Springer, Heidelberg (2009). doi:\n                      10.1007\/978-3-642-02384-2_6"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theor. 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR4","unstructured":"Becker, A., Joux, A., May, A., Meurer A.: Decoding random binary linear codes in \n                      \n                        \n                      \n                      $$2n, 20$$\n                    : how \n                      \n                        \n                      \n                      $$1+1=0$$\n                     improves information set decoding. In: Eurocrypt 2012 (2012)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 743\u2013760. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-22792-9_42"},{"key":"7_CR6","unstructured":"Chabot, C., Legeay, M.: Using permutation group for decoding. In: Proceedings of Algebraic and Combinatorial Coding Theory 2010, pp. 86\u201392 (2010)"},{"issue":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1109\/18.57202","volume":"36","author":"JT Coffey","year":"1990","unstructured":"Coffey, J.T., Goodman, R.M.: The complexity of Information-Set Decoding (ISD). IEEE Trans. Inf. Theor. 36(5), 1031\u20131037 (1990)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Coding Theory and Applications","year":"1989","unstructured":"Cohen, G., Wolfmann, J. (eds.): Coding Theory and Applications. LNCS, vol. 388. Springer, Heidelberg (1989)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Couvreur, A., Otmani, A., Tillich, J.-P.: Polynomial time attack on wild McEliece over quadratic extensions. Cryptology ePrint Archive 2014\/112 (2014)","DOI":"10.1007\/978-3-642-55220-5_2"},{"issue":"8","key":"7_CR10","doi-asserted-by":"publisher","first-page":"4166","DOI":"10.1109\/TIT.2010.2050814","volume":"56","author":"M Dubiner","year":"2010","unstructured":"Dubiner, M.: Bucketing coding and information theory for the statistical high-dimensional nearest-neighbor problem. IEEE Trans. Inf. Theor. 56(8), 4166\u20134179 (2010)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR11","unstructured":"Dumer, I.: On minimum distance decoding of linear codes. In: Proceedings 5th Joint Soviet-Swedish International Workshop Information Theory, Moscow, pp. 50\u201352 (1991)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J-C Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 279\u2013298. Springer, Heidelberg (2010)"},{"key":"7_CR13","unstructured":"Faug\u00e9re, J.-C., Otmani, A., Perret, L., de Portzamparc, F., Tillich, J.-P.: Structural cryptanalysis of McEliece schemes with compact keys. Cryptology ePrint Archive: Report 2014\/210 (2014)"},{"key":"7_CR14","unstructured":"Faug\u00e9re, J.C., Otmani, A., Perret, L., de Portzamparc, F., Tillich, J.P.: Folding alternant and Goppa codes with non-nrivial automorphism groups. \n                      arXiv:1405.5101v1\n                      \n                     [cs.IT], 20 May 2014"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"7_CR16","unstructured":"Johansson, T., L\u00f6ndahl, C.: An Improvement to Stern\u2019s Algorithm"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-25405-5_10","volume-title":"Post-Quantum Cryptography","author":"S Heyse","year":"2011","unstructured":"Heyse, S.: Implementation of McEliece based on quasi-dyadic goppa codes for embedded devices. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 143\u2013162. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-25405-5_10"},{"key":"7_CR18","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen, Norway, pp. 81\u201391, March 2005"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Hirose, S.: May-Ozerov algorithm for nearest-neighbor problem over \n                      \n                        \n                      \n                      $$\\mathbb{F}_q$$\n                     and its application to information set decoding. Cryptology ePrint Archive: Report 2016\/237 (2016)","DOI":"10.1007\/978-3-319-47238-6_8"},{"issue":"1","key":"7_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.4086\/toc.2012.v008a014","volume":"8","author":"S Har-Peled","year":"2012","unstructured":"Har-Peled, S., Indyk, P., Motwani, R.: Approximate nearest neighbor: towards removing the curse of dimensionality. Theor. Comput. 8(1), 321\u2013350 (2012)","journal-title":"Theor. Comput."},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-13190-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Howgrave-Graham","year":"2010","unstructured":"Howgrave-Graham, N., Joux, A.: New generic algorithms for hard knapsacks. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 235\u2013256. Springer, Heidelberg (2010)"},{"key":"7_CR22","unstructured":"Kobara, K.: Flexible quasi-dyadic code-based public-key encryption and signature. Cryptology ePrint Archive, Report 2009\/635 (2009)"},{"key":"7_CR23","unstructured":"Legeay, M.: Permutation decoding: towards an approach using algebraic properties of the \n                      \n                        \n                      \n                      $$\\sigma $$\n                    -subcode. In: Augot, D., Canteaut, A. (eds.) WCC 2011, pp. 193\u2013202 (2011)"},{"key":"7_CR24","unstructured":"Legeay, M.: Utilisation du groupe de permutations d\u2019un code correcteur pour am\u00e9liorer l\u2019\u00e9fficacit\u00e9 du d\u00e9codage. Universit\u00e9 de Rennes 1, Ann\u00e9e (2012)"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45961-8_25","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1988","author":"PJ Lee","year":"1988","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: Barstow, D., et al. (eds.) EUROCRYPT 1988. LNCS, vol. 330, pp. 275\u2013280. Springer, Heidelberg (1988). doi:\n                      10.1007\/3-540-45961-8_25"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"JS Leon","year":"1988","unstructured":"Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inf. Theor. 34, 1354\u20131359 (1988)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","volume-title":"Selected Areas in Cryptography","author":"R Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from Goppa codes. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 376\u2013392. Springer, Heidelberg (2009)"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.P, Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: ISIT 2013, pp. 2069\u20132073 (2013)","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"7_CR29","unstructured":"McEliece, R.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep., Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, pp. 114\u2013116, January 1978"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-25405-5_12","volume-title":"Post-Quantum Cryptography","author":"PSLM Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Lindner, R., Misoczki, R.: Monoidic codes in cryptography. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 179\u2013199. Springer, Heidelberg (2011)"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in \n                      \n                        \n                      \n                      $$\\tilde{\\cal{O}}(2^{0.054n})$$\n                    . In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107\u2013124. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-25385-0_6"},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-46800-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A May","year":"2015","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 203\u2013228. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-46800-5_9"},{"key":"7_CR33","unstructured":"Meurer, A.: A coding-theoretic approach to cryptanalysis. Dissertation thesis, Universit\u00e4t Bochum Ruhr, Novenber 2012"},{"key":"7_CR34","unstructured":"Niebuhr, R., Persichetti, E., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On lower bounds for information set decoding over \n                      \n                        \n                      \n                      $$\\mathbb{F}_q$$\n                     and on the effect of partial knowledge"},{"key":"7_CR35","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theor. 15, 159\u2013166 (1986)","journal-title":"Probl. Control Inf. Theor."},{"issue":"2","key":"7_CR36","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1515\/jmc-2011-0099","volume":"6","author":"E Persichetti","year":"2012","unstructured":"Persichetti, E.: Compact McEliece keys based on quasi-dyadic Srivastava codes. J. Math. Cryptology 6(2), 149\u2013169 (2012)","journal-title":"J. Math. Cryptology"},{"key":"7_CR37","unstructured":"Peters, C.: Information-set decoding for linear codes over \n                      \n                        \n                      \n                      $$\\mathbb{F}_q$$\n                    . Cryptology ePrint Archive 2009\/589 (2009)"},{"key":"7_CR38","first-page":"S5","volume":"IT\u20138","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of Information-Sets in decoding cyclic codes. IEEE Trans. IT\u20138, S5\u2013S9 (1962)","journal-title":"IEEE Trans."},{"key":"7_CR39","doi-asserted-by":"crossref","first-page":"57","DOI":"10.2478\/tmmp-2014-0025","volume":"60","author":"M Repka","year":"2014","unstructured":"Repka, M., Zajac, P.: Overview of the McEliece cryptosystem and its security. Tatra Mountains Math. Publ. 60, 57\u201383 (2014). doi:\n                      10.2478\/tmmp-2014-0025","journal-title":"Tatra Mountains Math. Publ."},{"key":"7_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J Stern","year":"1989","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1989). doi:\n                      10.1007\/BFb0019850"},{"key":"7_CR41","unstructured":"Umana, V.G., Leander, G.: Practical key recovery attacks on two McEliece variants. In: International Conference on Symbolic Computation and Cryptography SCC 2010, vol. 2010, p. 62 (2010)"}],"container-title":["Lecture Notes in Computer Science","Codes, Cryptology and Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55589-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:54:24Z","timestamp":1558317264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55589-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319555881","9783319555898"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55589-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"9 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"C2SI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Codes, Cryptology, and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"c2si2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.c2si-conference.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}