{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:47Z","timestamp":1743049667054,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030409203"},{"type":"electronic","value":"9783030409210"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-40921-0_12","type":"book-chapter","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T13:02:54Z","timestamp":1581598974000},"page":"194-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improvement of Binary and Non Binary Statistical Decoding Algorithm"],"prefix":"10.1007","author":[{"given":"Pierre-Louis","family":"Cayrel","sequence":"first","affiliation":[]},{"given":"Cheikh Thi\u00e9coumba","family":"Gueye","sequence":"additional","affiliation":[]},{"given":"Junaid Ahmad","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Jean Belo","family":"Klamti","sequence":"additional","affiliation":[]},{"given":"Edoardo","family":"Persichetti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,13]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in $$2^{n\/20}$$2n\/20: How 1 + 1 = 0 improves information set decoding. In: Eurocrypt 2012 (2012)","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Debris-Alazard, T., Tillich, J.-P.: Statistical decoding (2017). CoRR, abs\/1701.07416,","DOI":"10.1109\/ISIT.2017.8006839"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TIT.2006.887515","volume":"53","author":"MPC Fossorier","year":"2007","unstructured":"Fossorier, M.P.C., Kobara, K., Imai, H.: Modeling bit flipping decoding based on nonorthogonal check sums with application to iterative decoding attack of mceliece cryptosystem. IEEE Trans. Inf. Theory 53(1), 402\u2013411 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR4","series-title":"Cryptology and Information Security: Second International Conference, C2SI 2017, Rabat, Morocco, April 10\u201312, 2017, Proceedings - In Honor of Claude Carlet","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-55589-8_7","volume-title":"Codes","author":"CT Gueye","year":"2017","unstructured":"Gueye, C.T., Klamti, J.-B., Hirose, S.: Generalization of BJMM-ISD using may-ozerov nearest neighbor algorithm over an arbitrary finite field $$\\mathbb{F}_q$$Fq. In: El Hajji, S., Nitaj, A., Souidi, E.M. (eds.) Codes. Cryptology and Information Security: Second International Conference, C2SI 2017, Rabat, Morocco, April 10\u201312, 2017, Proceedings - In Honor of Claude Carlet, pp. 96\u2013109. Springer International Publishing, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-55589-8_7"},{"key":"12_CR5","unstructured":"Hirose, S.: May-ozerov algorithm for nearest-neighbor problem over $$\\mathbb{F}_q$$Fq and its application to information set decoding. Cryptology ePrint Archive, Report 2016\/237 (2016). \nhttp:\/\/eprint.iacr.org\/"},{"key":"12_CR6","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":"AA Jabri","year":"2001","unstructured":"Jabri, A.A.: A statistical decoding algorithm for general linear block codes. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 1\u20138. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45325-3_1"},{"key":"12_CR7","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 $$\\tilde{\\cal{O}}(2^{0.054n})$$O~(20.054n). In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107\u2013124. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25385-0_6"},{"key":"12_CR8","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). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46800-5_9"},{"key":"12_CR9","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DNS Progress Report, pp. 114\u2013116 (1978)"},{"key":"12_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/0471739219","volume-title":"Error Correction Coding: Mathematical Methods and Algorithms","author":"TK Moon","year":"2005","unstructured":"Moon, T.K.: Error Correction Coding: Mathematical Methods and Algorithms. Wiley, New York (2005)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-25405-5_14","volume-title":"Post-Quantum Cryptography","author":"R Niebuhr","year":"2011","unstructured":"Niebuhr, R.: Statistical decoding of codes over $$\\mathbb{F}_q$$Fq. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 217\u2013227. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25405-5_14"},{"key":"12_CR12","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. 4058, pp. 283\u2013294. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11780656_24"},{"key":"12_CR13","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}$$Fq. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 81\u201394. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-12929-2_7"},{"issue":"5","key":"12_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Proceedings of Coding Theory and Applications, pp. 106\u2013113 (1989)","DOI":"10.1007\/BFb0019850"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40921-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T19:08:25Z","timestamp":1581620905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-40921-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030409203","9783030409210"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40921-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}