{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T21:36:13Z","timestamp":1780090573977,"version":"3.54.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031478178","type":"print"},{"value":"9783031478185","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-47818-5_1","type":"book-chapter","created":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:02:28Z","timestamp":1701648148000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Upper-Bound on\u00a0the\u00a0Decoding Failure Probability of\u00a0the\u00a0LRPC Decoder"],"prefix":"10.1007","author":[{"given":"\u00c9tienne","family":"Burle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ayoub","family":"Otmani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,4]]},"reference":[{"key":"1_CR1","unstructured":"Melchor, C.A., et al.: Rank quasi cyclic (RQC). Second round submission to the NIST post-quantum cryptography call, April 2019"},{"key":"1_CR2","unstructured":"Melchor, C.A., Aragon, N., Dyseryn, V., Gaborit, P., Z\u00e9mor, G.: LRPC codes with multiple syndromes: near ideal-size KEMs without ideals. ArXiv, abs\/2206.11961 (2022)"},{"key":"1_CR3","unstructured":"Aragon, N., et al.: ROLLO (merger of Rank-Ouroboros, LAKE and LOCKER). Second round submission to the NIST post-quantum cryptography call, March 2019"},{"issue":"12","key":"1_CR4","doi-asserted-by":"publisher","first-page":"7697","DOI":"10.1109\/TIT.2019.2933535","volume":"65","author":"N Aragon","year":"2019","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Ruatta, O., Z\u00e9mor, G.: Low rank parity check codes: new decoding algorithms and applications to cryptography. IEEE Trans. Inform. Theory 65(12), 7697\u20137717 (2019)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Burle, \u00c9., Gaborit, P., Hatri, Y., Otmani, A.: Rank metric trapdoor functions with homogeneous errors. In: AlTawy, R., H\u00fclsing, A. (eds.) Selected Areas in Cryptography - SAC. LNCS. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99277-4","DOI":"10.1007\/978-3-030-99277-4"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226\u2013241 (1978)","DOI":"10.1016\/0097-3165(78)90015-8"},{"issue":"1","key":"1_CR7","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985)","journal-title":"Problemy Peredachi Informatsii"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"EM Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 482\u2013489. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_41"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"K Gibson","year":"1995","unstructured":"Gibson, K.: Severely denting the Gabidulin version of the McEliece public key cryptosystem. Des. Codes Cryptogr. 6(1), 37\u201345 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-68339-9_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"K Gibson","year":"1996","unstructured":"Gibson, K.: The security of the Gabidulin public key cryptosystem. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 212\u2013223. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_19"},{"key":"1_CR11","unstructured":"McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114\u2013116. Jet Propulsion Lab. DSN Progress Report 44 (1978)"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1090\/S0002-9947-1933-1501703-0","volume":"35","author":"\u00d8 Ore","year":"1933","unstructured":"Ore, \u00d8.: On a special class of polynomials. Trans. Amer. Math. Soc. 35(3), 559\u2013584 (1933)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"480","DOI":"10.2307\/1968173","volume":"34","author":"\u00d8 Ore","year":"1933","unstructured":"Ore, \u00d8.: Theory of non-commutative polynomials. Ann. Math. 34, 480 (1933)","journal-title":"Ann. Math."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11779360_15","volume-title":"Coding and Cryptography","author":"R Overbeck","year":"2006","unstructured":"Overbeck, R.: Extending Gibson\u2019s attacks on the GPT cryptosystem. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol. 3969, pp. 178\u2013188. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11779360_15"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11554868_5","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"R Overbeck","year":"2005","unstructured":"Overbeck, R.: A new structural attack for GPT and variants. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 50\u201363. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554868_5"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2008","unstructured":"Overbeck, R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptology 21(2), 280\u2013301 (2008)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47818-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:10:28Z","timestamp":1701648628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47818-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,4]]},"ISBN":["9783031478178","9783031478185"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47818-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,4]]},"assertion":[{"value":"4 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IMACC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IMA International Conference on Cryptography and Coding","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ima2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ima.org.uk\/21435\/19th-ima-international-conference-on-cryptography-and-coding\/","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":"36","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":"14","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":"39% - 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)"}}]}}