{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T18:51:18Z","timestamp":1771872678866,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031159787","type":"print"},{"value":"9783031159794","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-15979-4_18","type":"book-chapter","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T16:25:31Z","timestamp":1665591931000},"page":"513-540","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On\u00a0Codes\u00a0and\u00a0Learning\u00a0with\u00a0Errors\u00a0over Function Fields"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9081-6094","authenticated-orcid":false,"given":"Maxime","family":"Bombar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4554-6720","authenticated-orcid":false,"given":"Alain","family":"Couvreur","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8864-0245","authenticated-orcid":false,"given":"Thomas","family":"Debris-Alazard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,13]]},"reference":[{"key":"18_CR1","unstructured":"Aguilar Melchor, C., et al.: BIKE. Round 3 Submission to the NIST Post-Quantum Cryptography Call, v. 4.2, September 2021. https:\/\/bikesuite.org"},{"key":"18_CR2","unstructured":"Aguilar Melchor, C., et al.: HQC. Round 3 Submission to the NIST Post-Quantum Cryptography Call, June 2021. https:\/\/pqc-hqc.org\/doc\/hqc-specification_2021-06-06.pdf"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, 4\u20136 May 1997, pp. 284\u2013293 (1997). https:\/\/doi.org\/10.1145\/258533.258604, http:\/\/doi.acm.org\/10.1145\/258533.258604","DOI":"10.1145\/258533.258604"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the second round of the NIST post-quantum cryptography standardization process (2020)","DOI":"10.6028\/NIST.IR.8240"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 11\u201314 October 2003, Cambridge, MA, USA, pp. 298\u2013307. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238204","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Beelen, P., H\u00f8holdt, T.: The decoding of algebraic geometry codes. In: Advances in Algebraic Geometry Codes. Series Coding Theory Cryptology, vol. 5, pp. 49\u201398. World Scientific Publishing, Hackensack (2008)","DOI":"10.1142\/9789812794017_0002"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-56880-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"E Boyle","year":"2020","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 387\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1017\/S0017089500031244","volume":"38","author":"RJ Chapman","year":"1996","unstructured":"Chapman, R.J.: A simple proof of Noether\u2019s Theorem. Glasgow Math. J. 38, 49\u201351 (1996)","journal-title":"Glasgow Math. J."},{"key":"18_CR9","unstructured":"Conrad, K.: Carlitz extensions. https:\/\/kconrad.math.uconn.edu\/blurbs\/gradnumthy\/carlitz.pdf"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NT Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157\u2013174. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_10"},{"key":"18_CR11","unstructured":"Couvreur, A., Randriambololona, H.: Algebraic geometry codes and some applications, chap. 15, pp. 307\u2013361. CRC Press (2021)"},{"key":"18_CR12","unstructured":"Damg\u00e5rd, I., Park, S.: Is public-key encryption based on LPN practical? IACR Cryptol. ePrint Arch., p. 699 (2012). http:\/\/eprint.iacr.org\/2012\/699"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-34578-5_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"T Debris-Alazard","year":"2019","unstructured":"Debris-Alazard, T., Sendrier, N., Tillich, J.-P.: Wave: a new family of trapdoor one-way preimage sampleable functions based on codes. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 21\u201351. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_2"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-68339-9_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"JB Fischer","year":"1996","unstructured":"Fischer, J.B., Stern, J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 245\u2013255. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_22"},{"key":"18_CR15","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 (2005)"},{"issue":"6","key":"18_CR16","first-page":"1289","volume":"259","author":"VD Goppa","year":"1981","unstructured":"Goppa, V.D.: Codes on algebraic curves. Dokl. Akad. Nauk SSSR 259(6), 1289\u20131290 (1981). In Russian","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1090\/S0002-9947-1974-0330106-6","volume":"189","author":"DR Hayes","year":"1974","unstructured":"Hayes, D.R.: Explicit class field theory for rational function fields. Trans. Am. Math. Soc. 189, 77\u201391 (1974)","journal-title":"Trans. Am. Math. Soc."},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-34047-5_20","volume-title":"Fast Software Encryption","author":"S Heyse","year":"2012","unstructured":"Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., Pietrzak, K.: Lapin: an efficient authentication protocol based on ring-LPN. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 346\u2013365. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_20"},{"issue":"6","key":"18_CR19","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1109\/18.476214","volume":"41","author":"T H\u00f8holdt","year":"1995","unstructured":"H\u00f8holdt, T., Pellikaan, R.: On the decoding of algebraic-geometric codes. IEEE Trans. Inform. Theory 41(6), 1589\u20131614 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/hal.archives-ouvertes.fr\/hal-01240452","DOI":"10.1007\/s10623-014-9938-4"},{"key":"18_CR21","unstructured":"Lidl, R., Niederreiter, H.: Finite fields. In: Encyclopedia of Mathematics and its Applications, vol. 20, 2nd edn. Cambridge University Press, Cambridge (1997). With a foreword by P. M. Cohn"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V.: Search to decision reduction for the learning with errors over rings problem. In: ITW, pp. 410\u2013414. IEEE (2011)","DOI":"10.1109\/ITW.2011.6089491"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"18_CR24","unstructured":"McEliece, R.J.: A public-key system based on algebraic coding theory, pp. 114\u2013116. Jet Propulsion Lab (1978). dSN Progress Report 44"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 372\u2013381 (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.72","DOI":"10.1109\/FOCS.2004.72"},{"key":"18_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107325951","volume-title":"Rational Points on Curves Over Finite Fields: Theory and Applications","author":"H Niederreiter","year":"2001","unstructured":"Niederreiter, H., Xing, C.: Rational Points on Curves Over Finite Fields: Theory and Applications, vol. 288. Cambridge University Press, Cambridge (2001)"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1515\/crll.1932.167.147","volume":"167","author":"E Noether","year":"1932","unstructured":"Noether, E.: Normalbasis bei K\u00f6rpern ohne H\u00f6here Verzweigung. J. Reine Angew. Math. 167, 147\u2013152 (1932)","journal-title":"J. Reine Angew. Math."},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Peikert, C., Regev, O., Stephens-Davidowitz, N.: Pseudorandomness of ring-LWE for any ring and modulus. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 461\u2013473 (2017)","DOI":"10.1145\/3055399.3055489"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Pellet-Mary, A., Stehl\u00e9, D.: On the Hardness of the NTRU Problem. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 3\u201335. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_1, https:\/\/hal.archives-ouvertes.fr\/hal-03348022","DOI":"10.1007\/978-3-030-92062-3_1"},{"key":"18_CR30","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 84\u201393 (2005). https:\/\/doi.org\/10.1145\/1060590.1060603, http:\/\/doi.acm.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-78381-9_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Rosca","year":"2018","unstructured":"Rosca, M., Stehl\u00e9, D., Wallet, A.: On the ring-LWE and polynomial-LWE problems. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 146\u2013173. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_6"},{"key":"18_CR32","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6046-0","volume-title":"Number Theory in Function Fields","author":"M Rosen","year":"2002","unstructured":"Rosen, M.: Number Theory in Function Fields. Graduate Texts in Mathematics, Springer, New York (2002). https:\/\/doi.org\/10.1007\/978-1-4757-6046-0"},{"key":"18_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-25405-5_4","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2011","unstructured":"Sendrier, N.: Decoding one out of many. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 51\u201367. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_4"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617\u2013635. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"J Stern","year":"1994","unstructured":"Stern, J.: A new identification scheme based on syndrome decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 13\u201321. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_2"},{"key":"18_CR36","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic Function Fields and Codes","author":"H Stichtenoth","year":"2009","unstructured":"Stichtenoth, H.: Algebraic Function Fields and Codes. Graduate Texts in Mathematics, vol. 254, 2nd edn. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-540-76878-4","edition":"2"},{"issue":"1","key":"18_CR37","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/mana.19821090103","volume":"109","author":"MA Tsfasman","year":"1982","unstructured":"Tsfasman, M.A., Vl\u0103du\u0163, S.G., Zink, T.: Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound. Math. Nach. 109(1), 21\u201328 (1982)","journal-title":"Math. Nach."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15979-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:03:34Z","timestamp":1760220214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15979-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159787","9783031159794"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15979-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}