{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T13:10:07Z","timestamp":1748092207771,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031902284","type":"print"},{"value":"9783031902291","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-90229-1_2","type":"book-chapter","created":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T12:48:23Z","timestamp":1748090903000},"page":"25-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalizing the\u00a0Augot-Finiasz PKE to\u00a0Other Code Classes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2926-9797","authenticated-orcid":false,"given":"Anmoal","family":"Porwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0584-0995","authenticated-orcid":false,"given":"Anna","family":"Baumeister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-2885","authenticated-orcid":false,"given":"Violetta","family":"Weger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5174-1947","authenticated-orcid":false,"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7663-4662","authenticated-orcid":false,"given":"Pierre","family":"Loidreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,25]]},"reference":[{"issue":"12","key":"2_CR1","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. Inf. Theory 65(12), 7697\u20137717 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2933535","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Augot, D., Finiasz, M.: A public key encryption scheme based on the polynomial reconstruction problem. In: Biham, E. (ed.) Advances in Cryptology - EUROCRYPT 2003, pp. 229\u2013240. Lecture Notes in Computer Science, Springer (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_14","DOI":"10.1007\/3-540-39200-9_14"},{"key":"2_CR3","unstructured":"Augot, D., Finiasz, M., Loidreau, P.: Using the Trace Operator to repair the Polynomial Reconstruction based Cryptosystem presented at Eurocrypt 2003 (2003). https:\/\/eprint.iacr.org\/2003\/209"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Bleichenbacher, D., Kiayias, A., Yung, M.: Decoding of interleaved reed solomon codes over noisy data. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) Automata, Languages and Programming, pp. 97\u2013108. Lecture Notes in Computer Science, Springer (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_9","DOI":"10.1007\/3-540-45061-0_9"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Bombar, M., Couvreur, A.: Decoding supercodes of Gabidulin codes and applications to cryptanalysis. In: Post-Quantum Cryptography: 12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20-22, 2021, Proceedings, p. 3-22. Springer-Verlag, Berlin, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_1","DOI":"10.1007\/978-3-030-81293-5_1"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Coron, J.S.: Cryptanalysis of a public-key encryption scheme based on the polynomial reconstruction problem. In: Bao, F., Deng, R., Zhou, J. (eds.) Public Key Cryptography - PKC 2004, pp. 14\u201327. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-24632-9_2","DOI":"10.1007\/978-3-540-24632-9_2"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Faure, C., Loidreau, P.: A new public-key cryptosystem based on the problem of reconstructing p\u2013polynomials. In: Ytrehus, \u00d8. (ed.) Coding and Cryptography, pp. 304\u2013315. Lecture Notes in Computer Science, Springer (2006). https:\/\/doi.org\/10.1007\/11779360_24","DOI":"10.1007\/11779360_24"},{"key":"2_CR8","unstructured":"Gaborit, P., Murat, G., Ruatta, O., Zemor, G.: Low rank parity check codes and their application to cryptography. In: Budaghyan, L., Helleseth, T., Parker, M.G. (eds.) The International Workshop on Coding and Cryptography (WCC 13), p. 13 p. (2013). https:\/\/hal.science\/hal-00913719"},{"issue":"7","key":"2_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., Kalachi, H.T.: Polynomial-time key recovery attack on the Faure\u2013Loidreau scheme based on Gabidulin codes. Designs, Codes Cryptograph. 86(7), 1391\u20131403 (2018). https:\/\/doi.org\/10.1007\/s10623-017-0402-0","journal-title":"Designs, Codes Cryptograph."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-11659-4_6","volume-title":"Post-Quantum Cryptography","author":"P Gaborit","year":"2014","unstructured":"Gaborit, P., Ruatta, O., Schrek, J., Z\u00e9mor, G.: RankSign: an efficient signature algorithm based on the rank metric. In: Mosca, M. (ed.) Post-Quantum Cryptography, pp. 88\u2013107. Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_6"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Yung, M.: Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice. In: Lee, P.J. (ed.) Advances in Cryptology - ASIACRYPT 2004, pp. 401\u2013416. Lecture Notes in Computer Science, Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-30539-2_28","DOI":"10.1007\/978-3-540-30539-2_28"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Lavauzelle, J., Loidreau, P., Pham, B.D.: RAMESSES, a rank metric encryption scheme with short keys (2019). https:\/\/doi.org\/10.48550\/arXiv.1911.13119","DOI":"10.48550\/arXiv.1911.13119"},{"key":"2_CR13","unstructured":"Loidreau, P.: Decoding rank errors beyond the error-correcting capability. In: ACCT 2010, Tenth International Workshop on Algebraic and Combinatorial Coding Theory (2006)"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Ore, O.: On a Special Class of Polynomials. Trans. American Math. Society 35(3), 559\u2013584 (1933). https:\/\/doi.org\/10.2307\/1989849","DOI":"10.2307\/1989849"},{"key":"2_CR15","unstructured":"Overbeck, R.: Public key cryptography based on coding theory. Dissertation, Technische Universit\u00e4t Darmstadt (2007). https:\/\/tuprints.ulb.tu-darmstadt.de\/823\/"},{"key":"2_CR16","unstructured":"Randriambololona, H.: The syzygy distinguisher. Cryptology ePrint Archive, Paper 2024\/1193 (2024). https:\/\/eprint.iacr.org\/2024\/1193"},{"issue":"6","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1007\/s10623-021-00861-z","volume":"89","author":"J Renner","year":"2021","unstructured":"Renner, J., Puchinger, S., Wachter-Zeh, A.: LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding. Designs, Codes Cryptogr. 89(6), 1279\u20131319 (2021). https:\/\/doi.org\/10.1007\/s10623-021-00861-z","journal-title":"Designs, Codes Cryptogr."},{"issue":"7","key":"2_CR18","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1109\/TIT.2009.2021308","volume":"55","author":"G Schmidt","year":"2009","unstructured":"Schmidt, G., Sidorenko, V.R., Bossert, M.: Collaborative decoding of interleaved reed-solomon codes and concatenated code designs. IEEE Trans. Inf. Theory 55(7), 2991\u20133012 (2009). https:\/\/doi.org\/10.1109\/TIT.2009.2021308","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TIT.2010.2096032","volume":"57","author":"V Sidorenko","year":"2011","unstructured":"Sidorenko, V., Jiang, L., Bossert, M.: Skew-feedback shift-register synthesis and decoding interleaved gabidulin codes. IEEE Trans. Inf. Theory 57(2), 621\u2013632 (2011). https:\/\/doi.org\/10.1109\/TIT.2010.2096032","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90229-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T12:48:24Z","timestamp":1748090904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90229-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031902284","9783031902291"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90229-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"25 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","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":"cbc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cb-crypto.org\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}