{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:55:28Z","timestamp":1774976128912,"version":"3.50.1"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105356","type":"print"},{"value":"9783032105363","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-3-032-10536-3_18","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:32:02Z","timestamp":1767321122000},"page":"489-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["AI for\u00a0Code-based Cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-8412-4135","authenticated-orcid":false,"given":"Mohamed","family":"Malhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7453-8705","authenticated-orcid":false,"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1320-696X","authenticated-orcid":false,"given":"Kristin","family":"Lauter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"18_CR1","unstructured":"Albrecht, M.R., et al.: Classic McEliece: conservative code-based cryptography (2022). https:\/\/inria.hal.science\/hal-04288769, round 4 submission to the NIST call for postquantum cryptographic primitives"},{"key":"18_CR2","unstructured":"Aragon, N., et\u00a0al.: BIKE: bit flipping key encapsulation (2022)"},{"key":"18_CR3","unstructured":"Ba, J.L., Kiros, J., Hinton, G.E.: Layer normalization. arXiv preprint arXiv:1607.06450 (2016)"},{"key":"18_CR4","unstructured":"Bardet, M., Faug\u00e8re, J.C., Salvy, B., Yang, B.Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: The Effective Methods in Algebraic Geometry Conference \u2013 MEGA 2005, pp. 1\u201314 (2005)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bardet, M., Mora, R., Tillich, J.P.: Polynomial time key-recovery attack on high rate random alternant codes. IEEE Transactions on Information Theory (2023)","DOI":"10.1109\/TIT.2023.3334592"},{"issue":"3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J.: Grover vs. Mceliece. In: Sendrier, N. (ed.) Post-Quantum Cryptography, Third International Workshop, PQCrypto 2010, Darmstadt, Germany, May 25-28, 2010. Proceedings. Lecture Notes in Computer Science, vol.\u00a06061, pp. 73\u201380. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_6","DOI":"10.1007\/978-3-642-12929-2_6"},{"key":"18_CR8","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.): Post-quantum cryptography. Mathematics and Statistics Springer-11649; ZDB-2-SMA, Springer Berlin Heidelberg, Berlin, Heidelberg (2009). http:\/\/opac.inria.fr\/record=b1128738"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Bruno Buchberger\u2019s PhD thesis 1965: an algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Symbolic Comput. 41(3-4), 475\u2013511 (2006)","DOI":"10.1016\/j.jsc.2005.09.007"},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1089310.1089312","volume":"16","author":"B Buchberger","year":"1982","unstructured":"Buchberger, B., Collins, G.E., Loos, R.G.K., Albrecht, R.: Computer algebra symbolic and algebraic computation. SIGSAM Bull. 16(4), 5\u20135 (1982)","journal-title":"SIGSAM Bull."},{"key":"18_CR11","unstructured":"Chen, L., et al.: Report on post-quantum cryptography. Reasearch report NISTIR 8105, NIST (2003). http:\/\/csrc.nist.gov\/publications\/drafts\/nistir-8105\/nistir_8105_draft.pdf"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9-13, 2001, Proceedings. Lecture Notes in Computer Science, vol.\u00a02248, pp. 157\u2013174. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_10","DOI":"10.1007\/3-540-45682-1_10"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Couvreur, A., Mora, R., Tillich, J.P.: A new approach based on quadratic forms to attack the McEliece cryptosystem. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 3\u201338. Springer (2023)","DOI":"10.1007\/978-981-99-8730-6_1"},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1109\/TIT.2016.2574841","volume":"63","author":"A Couvreur","year":"2016","unstructured":"Couvreur, A., Otmani, A., Tillich, J.P.: Polynomial time attack on wild McEliece over quadratic extensions. IEEE Trans. Inf. Theory 63(1), 404\u2013427 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR15","unstructured":"Cox, D.A., Little, J.B., O\u2019Shea, D.: Ideals Varieties and Algorithms. Springer Verlag (2005)"},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02551274","volume":"2","author":"G Cybenko","year":"1989","unstructured":"Cybenko, G.: Approximation by superpositions of a sigmoidal function. Math. Control Signals Syst. 2(4), 303\u2013314 (1989)","journal-title":"Math. Control Signals Syst."},{"key":"18_CR17","unstructured":"Dallot, L.: S\u00e9curit\u00e9 de protocoles cryptographiques fond\u00e9s sur les codes correcteurs d\u2019erreurs. (Security of cryptographic protocols based on error correcting codes). Ph.D. thesis, University of Caen Normandy, France (2010). https:\/\/tel.archives-ouvertes.fr\/tel-01102440"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Debris-Alazard, T.: Code-based cryptography: Lecture notes. CoRR abs\/2304.03541 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2304.03541","DOI":"10.48550\/ARXIV.2304.03541"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J., Din, M.S.E., Spaenlehauer, P.: On the complexity of the generalized MinRank problem. J. Symb. Comput. 55, 30\u201358 (2013). https:\/\/doi.org\/10.1016\/J.JSC.2013.03.004","DOI":"10.1016\/J.JSC.2013.03.004"},{"issue":"10","key":"18_CR20","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"JC Faugere","year":"2013","unstructured":"Faugere, J.C., Gauthier-Umana, V., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high-rate McEliece cryptosystems. IEEE Trans. Inf. Theory 59(10), 6830\u20136844 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J., Otmani, A., Perret, L., de Portzamparc, F., Tillich, J.: Structural cryptanalysis of McEliece schemes with compact keys. Des. Codes Cryptogr. 79(1), 87\u2013112 (2016). https:\/\/doi.org\/10.1007\/S10623-015-0036-Z","DOI":"10.1007\/S10623-015-0036-Z"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J., Otmani, A., Perret, L., Tillich, J.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Gilbert, H. (ed.) Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco \/ French Riviera, May 30 - June 3, 2010. Proceedings. Lecture Notes in Computer Science, vol.\u00a06110, pp. 279\u2013298. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_14","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-26951-7_6","volume-title":"Advances in Cryptology - CRYPTO 2019","author":"A Gohr","year":"2019","unstructured":"Gohr, A.: Improving attacks on round-reduced Speck32\/64 using deep learning. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology - CRYPTO 2019, pp. 150\u2013179. Springer International Publishing, Cham (2019)"},{"key":"18_CR24","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge, MA (2016)"},{"issue":"3","key":"18_CR25","first-page":"24","volume":"6","author":"VD Goppa","year":"1970","unstructured":"Goppa, V.D.: A new class of linear correcting codes. Problemy Peredachi Informatsii 6(3), 24\u201330 (1970)","journal-title":"Problemy Peredachi Informatsii"},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Gryak, J., Haralick, R.M., Kahrobaei, D.: Solving the conjugacy decision problem via machine learning. Exp. Math. 29(1), 66\u201378 (2020). https:\/\/doi.org\/10.1080\/10586458.2018.1434704","DOI":"10.1080\/10586458.2018.1434704"},{"key":"18_CR27","unstructured":"Hendrycks, D., Gimpel, K.: Gaussian error linear units (GELUs). arXiv preprint arXiv:1606.08415 (2016)"},{"issue":"2","key":"18_CR28","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","volume":"4","author":"K Hornik","year":"1991","unstructured":"Hornik, K.: Approximation capabilities of multilayer feedforward networks. Neural Netw. 4(2), 251\u2013257 (1991)","journal-title":"Neural Netw."},{"key":"18_CR29","unstructured":"Kim, B.D., Vasudevan, V.A., D\u2019Oliveira, R.G., Cohen, A., Stahlbuhk, T., M\u00e9dard, M.: Cryptanalysis via machine learning based information theoretic metrics. arXiv preprint arXiv:2501.15076 (2025)"},{"key":"18_CR30","unstructured":"Kingma, D.P.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"18_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2023.105045","volume":"293","author":"E Kirshanova","year":"2023","unstructured":"Kirshanova, E., May, A.: Breaking Goppa-based McEliece with hints. Inf. Comput. 293, 105045 (2023)","journal-title":"Inf. Comput."},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Li, C., Wenger, E., Allen-Zhu, Z., Charton, F., Lauter, K.: SALSA VERDE: a machine learning attack on learning with errors with sparse small secrets. In: Proceedings of NeurIPS (2023)","DOI":"10.1145\/3576915.3623076"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Li, C.Y., et al.: SALSA PICANTE: a machine learning attack on LWE with binary secrets. In: Proceedings of ACM CCS (2023)","DOI":"10.1145\/3576915.3623076"},{"key":"18_CR34","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes (1977). https:\/\/api.semanticscholar.org\/CorpusID:118260868"},{"key":"18_CR35","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic. Coding Thv 4244, 114\u2013116 (1978)","journal-title":"Coding Thv"},{"key":"18_CR36","volume-title":"Combinatorial Commutative Algebra, Graduate Texts in Mathematics","author":"E Miller","year":"2005","unstructured":"Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra, Graduate Texts in Mathematics, vol. 227. Springer-Verlag, New York (2005)"},{"key":"18_CR37","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.P., Sendrier, N., Barreto, P.S.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: 2013 IEEE International Symposium on Information Theory, pp. 2069\u20132073. IEEE (2013)","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"18_CR38","unstructured":"National Institute of Standards and Technology: Module-Lattice-Based Digital Signature Standard. Federal Information Processing Standards Publication\u00a0204, U.S. Department of Commerce (2024). https:\/\/csrc.nist.gov\/pubs\/fips\/204\/final"},{"key":"18_CR39","unstructured":"National Institute of Standards and Technology: Module-Lattice-Based Key-Encapsulation Mechanism Standard. Federal Information Processing Standards Publication\u00a0203, U.S. Department of Commerce (2024). https:\/\/csrc.nist.gov\/pubs\/fips\/203\/final"},{"key":"18_CR40","unstructured":"National Institute of Standards and Technology: Stateless Hash-Based Digital Signature Standard. Federal Information Processing Standards Publication\u00a0205, U.S. Department of Commerce (2024). https:\/\/csrc.nist.gov\/pubs\/fips\/205\/final"},{"key":"18_CR41","unstructured":"National Institute of Standards and Technology (NIST): Post-Quantum Cryptography: Round 4 Submissions. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-4-submissions (2024). Accessed 31 Dec 2024"},{"key":"18_CR42","doi-asserted-by":"publisher","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography, pp. 95\u2013145. Springer Berlin Heidelberg, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_4","DOI":"10.1007\/978-3-540-88702-7_4"},{"key":"18_CR43","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-031-91095-1_12","volume-title":"Advances in Cryptology - EUROCRYPT 2025","author":"H Randriambololona","year":"2025","unstructured":"Randriambololona, H.: The syzygy distinguisher. In: Fehr, S., Fouque, P.A. (eds.) Advances in Cryptology - EUROCRYPT 2025, pp. 324\u2013354. Springer Nature Switzerland, Cham (2025)"},{"issue":"2","key":"18_CR44","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"6","key":"18_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 1\u201340 (2009)","journal-title":"J. ACM (JACM)"},{"key":"18_CR46","unstructured":"Stevens, S., et al.: SALSA FRESCA: Angular embeddings and pre-training for ml attacks on learning with errors. arXiv preprint arXiv:2402.01082 (2024)"},{"key":"18_CR47","doi-asserted-by":"publisher","unstructured":"Torres, R.C., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight. In: Takagi, T. (ed.) Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016, Fukuoka, Japan, February 24-26, 2016, Proceedings. Lecture Notes in Computer Science, vol.\u00a09606, pp. 144\u2013161. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_10","DOI":"10.1007\/978-3-319-29360-8_10"},{"key":"18_CR48","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems (NIPS), pp. 5998\u20136008 (2017)"},{"key":"18_CR49","unstructured":"Wenger, E., Chen, M., Charton, F., Lauter, K.E.: SALSA: attacking lattice cryptography with transformers. In: Proceedings of NeurIPS (2022)"},{"key":"18_CR50","unstructured":"Wenger, E., Saxena, E., Malhou, M., Thieu, E., Lauter, K.: Benchmarking attacks on learning with errors. Cryptology ePrint Archive, Paper 2024\/1229 (2024). https:\/\/eprint.iacr.org\/2024\/1229"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10536-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:32:05Z","timestamp":1767321125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10536-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105356","9783032105363"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10536-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"13 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC25\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}