{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T13:07:15Z","timestamp":1748092035038,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030812928"},{"type":"electronic","value":"9783030812935"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-81293-5_1","type":"book-chapter","created":{"date-parts":[[2021,7,14]],"date-time":"2021-07-14T23:30:59Z","timestamp":1626305459000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Bombar","sequence":"first","affiliation":[]},{"given":"Alain","family":"Couvreur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,15]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Tillich, J.P.: Improvement of generic attacks on the rank syndrome decoding problem, October 2017. https:\/\/hal.archives-ouvertes.fr\/hal-01618464, working paper or preprint","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"1_CR2","unstructured":"Augot, D., Couvreur, A., Lavauzelle, J., Neri, A.: Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes, June 2020. https:\/\/hal.archives-ouvertes.fr\/hal-02882019, 26 pages, 1 figure. https:\/\/hal.archives-ouvertes.fr\/hal-02882019"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-39200-9_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Augot","year":"2003","unstructured":"Augot, D., Finiasz, M.: A public key encryption scheme based on the polynomial reconstruction problem. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 229\u2013240. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_14"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory (Revised Edition), World Scientific (2015). https:\/\/doi.org\/10.1142\/9407","DOI":"10.1142\/9407"},{"key":"1_CR5","unstructured":"Coggia, D., Couvreur, A.: On the security of a Loidreau\u2019s rank metric code based encryption scheme. In: WCC 2019 - Workshop on Coding Theory and Cryptography. Saint Jacut de la mer, France, March 2019. https:\/\/hal.archives-ouvertes.fr\/hal-02064465"},{"key":"1_CR6","unstructured":"Coron, J.: Cryptanalysis of the repaired public-key encryption scheme based on the polynomial reconstruction problem. IACR Cryptology ePrint Archive 2003, 219 (2003). http:\/\/eprint.iacr.org\/2003\/219"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Faure, C., Loidreau, P.: A new public-key cryptosystem based on the problem of reconstructing p-polynomials. In: Coding and Cryptography, International Workshop, WCC 2005, Bergen, Norway, 14\u201318 March 2005. Revised Selected Papers, pp. 304\u2013315 (2005)","DOI":"10.1007\/11779360_24"},{"key":"1_CR8","doi-asserted-by":"publisher","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","DOI":"10.1007\/3-540-46416-6_41"},{"issue":"7","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1007\/s10623-017-0402-0","volume":"86","author":"P Gaborit","year":"2018","unstructured":"Gaborit, P., Otmani, A., Tal\u00e9-Kalachi, H.: Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes. Des. Codes Cryptogr. 86(7), 1391\u20131403 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR10","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. CoRR abs\/1301.1026 (2013). http:\/\/arxiv.org\/abs\/1301.1026"},{"key":"1_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61480-4","volume-title":"Basic Structures of Function Field arithmetic, Ergebnisse der Mathematik und ihrer Grenzgebiete (3)","author":"D Goss","year":"1996","unstructured":"Goss, D.: Basic Structures of Function Field arithmetic, Ergebnisse der Mathematik und ihrer Grenzgebiete (3), vol. 35. Springer-Verlag, Berlin (1996).[Results in Mathematics and Related Areas (3)]"},{"key":"1_CR12","unstructured":"Lavauzelle, J., Loidreau, P., Pham, B.D.: RAMESSES, a rank metric encryption scheme with short keys, January 2020. https:\/\/hal.archives-ouvertes.fr\/hal-02426624, working paper or preprint. Available online at ArXiv:1911.13119"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Loidreau, P.: A Welch-Berlekamp like algorithm for decoding Gabidulin codes. In: Ytrehus, \u00d8. (ed.) Coding and Cryptography, pp. 36\u201345. Springer, Berlin Heidelberg (2006)","DOI":"10.1007\/11779360_4"},{"key":"1_CR14","unstructured":"McEliece, R.J.: A public-key system based on algebraic coding theory, pp. 114\u2013116. Jet Propulsion Lab (1978), dSN Progress Report 44"},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1090\/S0002-9947-1933-1501703-0","volume":"35","author":"O Ore","year":"1933","unstructured":"Ore, O.: On a special class of polynomials. Trans. Amer. Math. Soc. 35(3), 559\u2013584 (1933)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1_CR16","unstructured":"Renner, J., Puchinger, S., Wachter-Zeh, A.: LIGA: A cryptosystem based on the hardness of rank-metric list and interleaved decoding (2020), available online at ArXiv:1812.04892"},{"key":"1_CR17","unstructured":"Stein, W., et\u00a0al.: Sage Mathematics Software (Version 9.2). The Sage Development Team (2020), http:\/\/www.sagemath.org"},{"key":"1_CR18","unstructured":"Wachter-Zeh, A.: Decoding of block and convolutional codes in rank metric. theses, Universit\u00e9 Rennes 1, October 2013. https:\/\/tel.archives-ouvertes.fr\/tel-01056746"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Wachter-Zeh, A., Puchinger, S., Renner, J.: Repairing the Faure-Loidreau public-key cryptosystem. In: Proceedings of IEEE International Symposium Information Theory - ISIT, pp. 2426\u20132430 (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437561","DOI":"10.1109\/ISIT.2018.8437561"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81293-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T19:45:43Z","timestamp":1658519143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81293-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030812928","9783030812935"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81293-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Daejeon","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/pqcrypto2021.kr\/","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":"65","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":"25","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":"38% - 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.2","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":"2","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)"}}]}}