{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T15:44:05Z","timestamp":1765122245315,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":60,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551125","type":"print"},{"value":"9789819551132","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5113-2_16","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T15:43:40Z","timestamp":1765122220000},"page":"498-531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Higher-Genus McEliece"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanja","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Pellegrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"16_CR1","unstructured":"Aguilar-Melchor, C., et al.: HQC. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"key":"16_CR2","unstructured":"Albrecht, M.R., et al.: Classic McEliece. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-4-submissions"},{"key":"16_CR3","unstructured":"Aragon, N., et al.: BIKE. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(02)00586-3","volume":"130","author":"S Arita","year":"2003","unstructured":"Arita, S.: An addition algorithm in Jacobian of $$C_{ab}$$ curves. Discrete Appl. Math. 130(1), 13\u201331 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(02)00586-3","journal-title":"Discrete Appl. Math."},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Augot, D., Barbier, M., Couvreur, A.: List-decoding of binary Goppa codes up to the binary Johnson bound. In: 2011 IEEE Information Theory Workshop, ITW 2011, Paraty, Brazil, October 16\u201320, 2011, pp. 229\u2013233. IEEE (2011). https:\/\/doi.org\/10.1109\/ITW.2011.6089384.","DOI":"10.1109\/ITW.2011.6089384."},{"issue":"6","key":"16_CR6","doi-asserted-by":"publisher","first-page":"3269","DOI":"10.1109\/TIT.2013.2243800","volume":"59","author":"P Beelen","year":"2013","unstructured":"Beelen, P., H\u00f8holdt, T., Nielsen, J.S.R., Yingquan, W.: On rational interpolation-based list-decoding and list-decoding binary Goppa codes. IEEE Trans. Inf. Theory 59(6), 3269\u20133281 (2013). https:\/\/doi.org\/10.1109\/TIT.2013.2243800","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"16_CR7","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/TIT.2025.3550750","volume":"71","author":"P Beelen","year":"2025","unstructured":"Beelen, P., Neiger, V.: Faster list decoding of AG codes. IEEE Trans. Inf. Theory 71(5), 3397\u20133408 (2025). https:\/\/doi.org\/10.1109\/TIT.2025.3550750","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1109\/TIT.2020.3042248","volume":"67","author":"P Beelen","year":"2021","unstructured":"Beelen, P., Rosenkilde, J., Solomatov, G.: Fast encoding of AG codes over $$C_{ab}$$ curves. IEEE Trans. Inf. Theory 67(3), 1641\u20131655 (2021). https:\/\/doi.org\/10.1109\/TIT.2020.3042248","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"16_CR9","doi-asserted-by":"publisher","first-page":"7215","DOI":"10.1109\/TIT.2022.3188843","volume":"68","author":"P Beelen","year":"2022","unstructured":"Beelen, P., Rosenkilde, J., Solomatov, G.: Fast decoding of AG codes. IEEE Trans. Inf. Theory 68(11), 7215\u20137232 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3188843","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J.: List decoding for binary Goppa codes. In: Chee, L.M., et al. (eds.) Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30\u2013June 3, 2011. Proceedings, volume 6639 of Lecture Notes in Computer Science, pp. 62\u201380. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_4.","DOI":"10.1007\/978-3-642-20901-7_4."},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J.: Simplified high-speed high-distance list decoding for alternant codes. In: Yang, B.Y. (ed) Post-Quantum Cryptography - 4th International Workshop, PQCrypto 2011, pp. 200\u2013216, Tapei, Taiwan, November 29\u2013December 2 2011. Springer Berlin Heidelberg, Germany (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_13","DOI":"10.1007\/978-3-642-25405-5_13"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Chou, T.: CryptAttackTester: high-assurance attack analysis. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2024, Part VI, volume 14925 of Lecture Notes in Computer Science, pp. 141\u2013182, Santa Barbara, CA, USA, August 18\u201322, 2024. Springer, Cham, Switzerland (2024). https:\/\/doi.org\/10.1007\/978-3-031-68391-6_5","DOI":"10.1007\/978-3-031-68391-6_5"},{"key":"16_CR13","unstructured":"Bernstein, D.J., Lange, T., Pellegrini, A.: Higher-genus McEliece (2025). Latest full version of this paper. https:\/\/eprint.iacr.org\/2025"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Buchmann, J., Ding, J. (eds.) Post-Quantum Cryptography, Second International Workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17\u201319, 2008, Proceedings, volume 5299 of Lecture Notes in Computer Science, pp. 31\u201346. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-88403-3_3","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"16_CR15","unstructured":"Bernstein, D.J., Persichetti, E.: Towards KEM unification. Cryptology ePrint Archive, Report 2018\/526 (2018). https:\/\/eprint.iacr.org\/2018\/526"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Biasse, J.F., Song, F.: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In: Krauthgamer, R. (ed.) 27th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 893\u2013902, Arlington, VA, USA, January 10\u201312, 2016. ACM-SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch64","DOI":"10.1137\/1.9781611974331.ch64"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Bindel, N., Hamburg, M., H\u00f6velmanns, K., H\u00fclsing, A., Persichetti, E.: Tighter proofs of CCA security in the quantum random oracle model. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019: 17th Theory of Cryptography Conference, Part II, volume 11892 of Lecture Notes in Computer Science, pp. 61\u201390, Nuremberg, Germany, December 1\u20135, 2019. Springer, Cham, Switzerland (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_3","DOI":"10.1007\/978-3-030-36033-7_3"},{"key":"16_CR18","unstructured":"Cohen, H.: Advanced Topics in Computational Number Theory. Springer (2000). https:\/\/api.semanticscholar.org\/CorpusID:118279568"},{"issue":"8","key":"16_CR19","doi-asserted-by":"publisher","first-page":"5404","DOI":"10.1109\/TIT.2017.2712636","volume":"63","author":"A Couvreur","year":"2017","unstructured":"Couvreur, A., Corbella, I.M., Pellikaan, R.: Cryptanalysis of McEliece cryptosystem based on algebraic geometry codes and their subcodes. IEEE Trans. Inf. Theory 63(8), 5404\u20135418 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2712636","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Couvreur, A., M\u00e1rquez-Corbella, I., Pellikaan, R.: Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes. In: Pinto, R., Malonek, P.R., Vettori, P. (eds.) Coding Theory and Applications, 4th International Castle Meeting, ICMCTA 2014, Palmela Castle, Portugal, September 15\u201318, 2014, volume\u00a03 of CIM Series in Mathematical Sciences, pp. 133\u2013140. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-17296-5_13","DOI":"10.1007\/978-3-319-17296-5_13"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Couvreur, A., Mora, R., Tillich, J.P.: A new approach based on quadratic forms to attack the McEliece cryptosystem. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2023, Part\u00a0IV, volume 14441 of Lecture Notes in Computer Science, pp. 3\u201338, Guangzhou, China, December 4\u20138, 2023. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8730-6_1","DOI":"10.1007\/978-981-99-8730-6_1"},{"key":"16_CR22","unstructured":"Couvreur, A., Randriambololona, H.: Algebraic geometry codes and some applications. In: Huffman, W.C., Kim, J.L., Sol\u00e9, P. (eds.) A Concise Encyclopedia of Coding Theory, pp. 998. Chapman and Hall\/CRC (2021). https:\/\/hal.archives-ouvertes.fr\/hal-02931167"},{"key":"16_CR23","unstructured":"De\u00a0Boer, M.A.: Codes: their parameters and geometry. Ph. D. thesis, Technische Universiteit Eindhoven (1997). https:\/\/pure.tue.nl\/ws\/portalfiles\/portal\/1609368\/492527.pdf"},{"issue":"3","key":"16_CR24","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1090\/S0002-9939-1990-0990420-2","volume":"108","author":"F Delgado","year":"1990","unstructured":"Delgado, F.: The symmetry of the Weierstrass generalized semigroups and affine embeddings. Proc. Am. Math. Soc. 108(3), 627\u2013631 (1990). https:\/\/doi.org\/10.1090\/S0002-9939-1990-0990420-2","journal-title":"Proc. Am. Math. Soc."},{"key":"16_CR25","unstructured":"Faug\u00e8re, J.C., Gauthier, V., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high rate McEliece cryptosystems. Cryptology ePrint Archive, Report 2010\/331 (2010). https:\/\/eprint.iacr.org\/2010\/331"},{"key":"16_CR26","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., Tillich, J.P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Gilbert, H. (ed.) Advances in Cryptology \u2013 EUROCRYPT 2010, volume 6110 of Lecture Notes in Computer Science, pp. 279\u2013298, French Riviera, May 30\u2013June 3, 2010. Springer Berlin Heidelberg, Germany (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_14","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"16_CR27","unstructured":"Faure, C., Minder, L.: Cryptanalysis of the McEliece cryptosystem over hyperelliptic codes. In: Proceedings of the 11th International Workshop on Algebraic and Combinatorial Coding Theory, ACCT, volume 2008, pp. 99\u2013107 (2008). http:\/\/www.moi.math.bas.bg\/acct2008\/b17.pdf"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Frey, G., Shaska, T.: Curves, Jacobians, and cryptography (2018). https:\/\/arxiv.org\/abs\/1807.05270","DOI":"10.1090\/conm\/724\/14596"},{"issue":"237","key":"16_CR29","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0025-5718-00-01297-7","volume":"71","author":"SD Galbraith","year":"2002","unstructured":"Galbraith, S.D., Paulus, S.M., Smart, N.P.: Arithmetic on superelliptic curves. Math. Comput. 71(237), 393\u2013405 (2002). https:\/\/doi.org\/10.1090\/S0025-5718-00-01297-7","journal-title":"Math. Comput."},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"Gao, S.: A new algorithm for decoding Reed-Solomon codes. In: Bhargava, V.K., Poor, H.V., Tarokh, V., Yoon, S. (eds.) Communications, Information and Network Security, pp. 55\u201368. Springer US (2003). https:\/\/doi.org\/10.1007\/978-1-4757-3789-9_5","DOI":"10.1007\/978-1-4757-3789-9_5"},{"issue":"6","key":"16_CR31","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1109\/18.476212","volume":"41","author":"AG Garcia","year":"1995","unstructured":"Garcia, A.G., Stichtenoth, H.: Algebraic function fields over finite fields with many rational places. IEEE Trans. Inf. Theory 41(6), 1548\u20131563 (1995). https:\/\/doi.org\/10.1109\/18.476212","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR32","first-page":"24","volume":"60","author":"VD Goppa","year":"1970","unstructured":"Goppa, V.D.: A new class of linear error correcting codes. Problemy Peredachi Informatsii 60, 24\u201330 (1970)","journal-title":"Problemy Peredachi Informatsii"},{"key":"16_CR33","doi-asserted-by":"publisher","unstructured":"Harasawa, R., Suzuki, J.: Fast Jacobian group arithmetic on $$C_{ab}$$ curves. In: Algebraic Number Theory, volume 1838 of Lecture Notes in Computer Science, pp. 359\u2013376. Springer (2000). https:\/\/doi.org\/10.1007\/10722028_21","DOI":"10.1007\/10722028_21"},{"issue":"4","key":"16_CR34","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1006\/jsco.2001.0513","volume":"33","author":"F Hess","year":"2002","unstructured":"Hess, F.: Computing Riemann-Roch spaces in algebraic function fields and related topics. J. Symb. Comput. 33(4), 425\u2013445 (2002). https:\/\/doi.org\/10.1006\/jsco.2001.0513","journal-title":"J. Symb. Comput."},{"key":"16_CR35","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. Cryptology ePrint Archive, Report 2017\/604 (2017). https:\/\/eprint.iacr.org\/2017\/604"},{"issue":"3","key":"16_CR36","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"H Janwa","year":"1996","unstructured":"Janwa, H., Moreno, O.: McEliece public key cryptosystems using algebraic-geometric codes. Des. Codes Crypt. 8(3), 293\u2013307 (1996). https:\/\/doi.org\/10.1023\/A:1027351723034","journal-title":"Des. Codes Crypt."},{"issue":"5","key":"16_CR37","doi-asserted-by":"publisher","first-page":"3330","DOI":"10.1109\/TIT.2023.3334096","volume":"70","author":"S El Khalfaoui","year":"2024","unstructured":"El Khalfaoui, S., Lhotel, M., Nardi, J.: Goppa\u2013like AG codes from $$C_{a, b}$$ curves and their behavior under squaring their dual. IEEE Trans. Inf. Theory 70(5), 3330\u20133344 (2024). https:\/\/doi.org\/10.1109\/TIT.2023.3334096","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"245","key":"16_CR38","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1090\/S0025-5718-03-01567-9","volume":"73","author":"K Khuri-Makdisi","year":"2004","unstructured":"Khuri-Makdisi, K.: Linear algebra algorithms for divisors on an algebraic curve. Math. Comput. 73(245), 333\u2013357 (2004). https:\/\/doi.org\/10.1090\/S0025-5718-03-01567-9","journal-title":"Math. Comput."},{"issue":"3","key":"16_CR39","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptol. 1(3), 139\u2013150 (1989). https:\/\/doi.org\/10.1007\/BF02252872","journal-title":"J. Cryptol."},{"issue":"6","key":"16_CR40","doi-asserted-by":"publisher","first-page":"3941","DOI":"10.1109\/TIT.2012.2182757","volume":"58","author":"K Lee","year":"2012","unstructured":"Lee, K., Bras-Amor\u00f3s, M., O\u2019Sullivan, M.E.: Unique decoding of plane AG codes via interpolation. IEEE Trans. Inf. Theory 58(6), 3941\u20133950 (2012). https:\/\/doi.org\/10.1109\/TIT.2012.2182757","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR41","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. The deep space network progress report 42\u201344, Jet Propulsion Laboratory, California Institute of Technology, January\/February (1978). https:\/\/ipnpr.jpl.nasa.gov\/progress_report2\/42-44\/44N.PDF"},{"key":"16_CR42","unstructured":"Minder, L.: Cryptography based on error correcting codes. Ph. D. thesis, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (Switzerland) (2007). http:\/\/infoscience.epfl.ch\/record\/104417"},{"issue":"12","key":"16_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/ecjc.4430761201","volume":"76","author":"S Miura","year":"1993","unstructured":"Miura, S.: Algebraic geometric codes on certain plane curves. Electron. Commun. Japan III Fundam. Electron. Sci. 76(12), 1\u201313 (1993). https:\/\/doi.org\/10.1002\/ecjc.4430761201","journal-title":"Electron. Commun. Japan III Fundam. Electron. Sci."},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"Nagy, G.P., El Khalfaoui, S.: Towards the security of McEliece\u2019s cryptosystem based on Hermitian subfield subcodes (2021). https:\/\/www.spsl.nsc.ru\/FullText\/konfe\/S2021.pdf#page=176","DOI":"10.17223\/2226308X\/14\/39"},{"issue":"2","key":"16_CR45","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Prob. Control Inf. Theory"},{"issue":"6","key":"16_CR46","doi-asserted-by":"publisher","first-page":"3225","DOI":"10.1109\/TIT.2015.2424415","volume":"61","author":"JSR Nielsen","year":"2015","unstructured":"Nielsen, J.S.R., Beelen, P.: Sub-quadratic decoding of one-point Hermitian codes. IEEE Trans. Inf. Theory 61(6), 3225\u20133240 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2424415","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR47","unstructured":"Pellegrini, A.: Code-based cryptography and AG codes. In: Talk at DIAMANT Symposium Autumn (2022). https:\/\/drive.google.com\/file\/d\/1RDT455gEV2WQQcWzKZE9JbkG7tgYzMMg\/view"},{"key":"16_CR48","unstructured":"Pellegrini, A.: Code-based cryptography and AG codes. In: Talk at COGNAC (2023). https:\/\/www.cirm-math.fr\/RepOrga\/2803\/Slides\/Pellegrini_slides.pdf"},{"key":"16_CR49","unstructured":"Persichetti, E.: Improving the efficiency of code-based cryptography. Ph. D. thesis, University of Auckland (2012). https:\/\/www.math.auckland.ac.nz\/~sgal018\/EdoardoPhD.pdf"},{"key":"16_CR50","doi-asserted-by":"publisher","unstructured":"Randriambololona, H.: The syzygy distinguisher. In: Fehr, S., Fouque, P.A. (eds.) Advances in Cryptology - EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, May 4\u20138, 2025, Proceedings, Part VI, volume 15606 of Lecture Notes in Computer Science, pp. 324\u2013354. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-91095-1_12","DOI":"10.1007\/978-3-031-91095-1_12"},{"issue":"5","key":"16_CR51","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.2307\/2374003","volume":"99","author":"A Sathaye","year":"1977","unstructured":"Sathaye, A.: On planar curves. Am. J. Math. 99(5), 1105\u20131135 (1977). https:\/\/doi.org\/10.2307\/2374003","journal-title":"Am. J. Math."},{"issue":"4","key":"16_CR52","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inf. Theory 46(4), 1193\u20131203 (2000). https:\/\/doi.org\/10.1109\/18.850662","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR53","doi-asserted-by":"publisher","unstructured":"Shen, B.Z.: Algebraic-geometric codes and their decoding algorithm. Ph. D. thesis, Technische Universiteit Eindhoven (1992). https:\/\/doi.org\/10.6100\/IR381307","DOI":"10.6100\/IR381307"},{"issue":"1","key":"16_CR54","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/18.50376","volume":"36","author":"H Stichtenoth","year":"1990","unstructured":"Stichtenoth, H.: On the dimension of subfield subcodes. IEEE Trans. Inf. Theory 36(1), 90\u201393 (1990). https:\/\/doi.org\/10.1109\/18.50376","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR55","doi-asserted-by":"publisher","unstructured":"Stichtenoth, H.: Algebraic Function Fields and Codes, 2nd ed. Springer Publishing Company, Incorporated (2008). https:\/\/doi.org\/10.1007\/978-3-540-76878-4","DOI":"10.1007\/978-3-540-76878-4"},{"key":"16_CR56","doi-asserted-by":"publisher","unstructured":"Wang, T., Wang, A., Wang, X.: Exploring decryption failures of BIKE: New class of weak keys and key recovery attacks. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023, Part III, volume 14083 of Lecture Notes in Computer Science, pp. 70\u2013100, Santa Barbara, CA, USA, August 20\u201324, 2023. Springer, Cham, Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_3","DOI":"10.1007\/978-3-031-38548-3_3"},{"key":"16_CR57","doi-asserted-by":"publisher","unstructured":"Wieschebrink, C.: An attack on a modified Niederreiter encryption scheme. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC\u00a02006: 9th International Conference on Theory and Practice of Public Key Cryptography, volume 3958 of Lecture Notes in Computer Science, pp. 14\u201326, New York, NY, USA, April\u00a024\u201326, 2006. Springer Berlin Heidelberg, Germany (2006). https:\/\/doi.org\/10.1007\/11745853_2","DOI":"10.1007\/11745853_2"},{"key":"16_CR58","doi-asserted-by":"publisher","unstructured":"Wieschebrink, C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. In: Sendrier, N. (ed.) The Third International Workshop on Post-Quantum Cryptography, PQCRYPTO 2010, pp. 61\u201372, Darmstadt, Germany, May\u00a025\u201328, 2010. Springer Berlin Heidelberg, Germany (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_5","DOI":"10.1007\/978-3-642-12929-2_5"},{"issue":"5","key":"16_CR59","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1109\/18.21264","volume":"34","author":"M Wirtz","year":"1988","unstructured":"Wirtz, M.: On the parameters of Goppa codes. IEEE Trans. Inf. Theory 34(5), 1341\u20131343 (1988). https:\/\/doi.org\/10.1109\/18.21264","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR60","doi-asserted-by":"publisher","unstructured":"Zhou, W., Labahn, G.: Computing column bases of polynomial matrices. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, pp. 379\u2013386 (2013). https:\/\/doi.org\/10.1145\/2465506.2465947","DOI":"10.1145\/2465506.2465947"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5113-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T15:43:44Z","timestamp":1765122224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5113-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551125","9789819551132"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5113-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}