{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T20:30:28Z","timestamp":1786480228900,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031910944","type":"print"},{"value":"9783031910951","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-91095-1_14","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T05:15:09Z","timestamp":1745730909000},"page":"385-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the\u00a0Soundness of\u00a0Algebraic Attacks Against Code-Based Assumptions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2505-4246","authenticated-orcid":false,"given":"Miguel","family":"Cueto Noval","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2475-2966","authenticated-orcid":false,"given":"Simon-Philipp","family":"Merz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"St\u00e4hlin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8929-0221","authenticated-orcid":false,"given":"Akin","family":"\u00dcnal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press, May 1996. https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"14_CR2","unstructured":"Albrecht, M.R., Cid, C., Faug\u00e8re, J.C., Perret, L.: Algebraic algorithms for LWE. Cryptology ePrint Archive, Report 2014\/1018 (2014). https:\/\/eprint.iacr.org\/2014\/1018"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-22006-7_34","volume-title":"Automata, Languages and Programming","author":"S Arora","year":"2011","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 403\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34"},{"key":"14_CR4","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function. Cryptology ePrint Archive, Report 2003\/230 (2003). https:\/\/eprint.iacr.org\/2003\/230"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42"},{"key":"14_CR6","unstructured":"Bardet, M., Faug\u00e8re, J.C., Salvy, B.: Complexity of Gr\u00f6bner basis computation for Semi-regular Overdetermined sequences over F_2 with solutions in F_2. Research Report RR-5049, INRIA (2003). https:\/\/inria.hal.science\/inria-00071534"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Bitzer, S., Pavoni, A., Weger, V., Santini, P., Baldi, M., Wachter-Zeh, A.: Generic decoding of restricted errors. In: 2023 IEEE International Symposium on Information Theory (ISIT), pp. 246\u2013251 (2023). https:\/\/doi.org\/10.1109\/ISIT54713.2023.10206983","DOI":"10.1109\/ISIT54713.2023.10206983"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 896\u2013912. ACM Press, October 2018. https:\/\/doi.org\/10.1145\/3243734.3243868","DOI":"10.1145\/3243734.3243868"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"14_CR10","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\u00a0pseudorandom\u00a0correlation\u00a0generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 387\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14"},{"key":"14_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-031-30589-4_14","volume-title":"EUROCRYPT 2023, Part V","author":"P Briaud","year":"2023","unstructured":"Briaud, P., \u00d8ygarden, M.: A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part V. LNCS, vol. 14008, pp. 391\u2013422. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_14"},{"key":"14_CR12","unstructured":"Bui, D., Couteau, G., Melissaris, N.: Structured-seed local pseudorandom generators and their applications. Cryptology ePrint Archive, Report 2024\/1027 (2024). https:\/\/eprint.iacr.org\/2024\/1027"},{"key":"14_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-031-30589-4_19","volume-title":"EUROCRYPT 2023, Part V","author":"E Carozza","year":"2023","unstructured":"Carozza, E., Couteau, G., Joux, A.: Short signatures from regular syndrome decoding in the head. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part V. LNCS, vol. 14008, pp. 532\u2013563. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_19"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"RA Demillo","year":"1978","unstructured":"Demillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193\u2013195 (1978). https:\/\/doi.org\/10.1016\/0020-0190(78)90067-4","journal-title":"Inf. Process. Lett."},{"key":"14_CR15","unstructured":"Ding, J., Buchmann, J., Mohamed, M.S.E., Mohamed, W.S.A.E., Weinmann, R.P.: Mutantxl. SCC (TUD-CS-2009-0142), 16\u201322 (2008). http:\/\/tubiblio.ulb.tu-darmstadt.de\/100617\/"},{"key":"14_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-031-68391-6_6","volume-title":"CRYPTO 2024, Part VI","author":"A Esser","year":"2024","unstructured":"Esser, A., Santini, P.: Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VI. LNCS, vol. 14925, pp. 183\u2013217. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68391-6_6"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Fr\u00f6berg, R.: An inequality for hilbert series of graded algebras. Mathematica Scandinavica 56, 117\u2013144 (1985). https:\/\/doi.org\/10.7146\/math.scand.a-12092. https:\/\/www.mscand.dk\/article\/view\/12092","DOI":"10.7146\/math.scand.a-12092"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Fr\u00f6berg, R., Hollman, J.: Hilbert series for ideals generated by generic forms. J. Symb. Comput. 17(2), 149\u2013157 (1994). https:\/\/doi.org\/10.1006\/jsco.1994.1008. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S074771718471008X","DOI":"10.1006\/jsco.1994.1008"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-96878-0_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"C Hazay","year":"2018","unstructured":"Hazay, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: TinyKeys: a new approach to efficient multi-party computation. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part III. LNCS, vol. 10993, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_1"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Hodges, T.J., Molina, S.D., Schlather, J.: On the existence of homogeneous semi-regular sequences in f2[x1, ..., xn]\/(x12, ..., xn2). J. Algebra 476, 519\u2013547 (2017). https:\/\/doi.org\/10.1016\/j.jalgebra.2016.11.025. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0021869316304732","DOI":"10.1016\/j.jalgebra.2016.11.025"},{"key":"14_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-031-58751-1_6","volume-title":"EUROCRYPT 2024, Part VI","author":"H Liu","year":"2024","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: The hardness of LPN over any integer ring and field for PCG applications. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part VI. LNCS, vol. 14656, pp. 149\u2013179. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_6"},{"key":"14_CR22","unstructured":"Lou, P., Sahai, A., Sivashankar, V.: Relinearization attack on LPN over large fields (2022). https:\/\/www.cfail.org\/_files\/ugd\/6a3e24_bdd034dc2a264d4a8b0fb1856daa823a.pdf"},{"key":"14_CR23","unstructured":"Lyubashevsky, V.: Basic lattice cryptography: the concepts behind kyber (ML-KEM) and dilithium (ML-DSA). Cryptology ePrint Archive, Report 2024\/1287 (2024). https:\/\/eprint.iacr.org\/2024\/1287"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-40041-4_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Micciancio","year":"2013","unstructured":"Micciancio, D., Peikert, C.: Hardness of SIS and LWE with small parameters. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 21\u201339. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_2"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Pardue, K.: Generic sequences of polynomials. J. Algebra 324(4), 579\u2013590 (2010). https:\/\/doi.org\/10.1016\/j.jalgebra.2010.04.018. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0021869310001948","DOI":"10.1016\/j.jalgebra.2010.04.018"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Ragavan, S., Vafa, N., Vaikuntanathan, V.: Indistinguishability obfuscation from bilinear maps and LPN variants. Cryptology ePrint Archive, Report 2024\/856 (2024). https:\/\/eprint.iacr.org\/2024\/856","DOI":"10.1007\/978-3-031-78023-3_1"},{"key":"14_CR27","unstructured":"Salizzoni, F.: An upper bound for the solving degree in terms of the degree of regularity (2023). https:\/\/arxiv.org\/abs\/2304.13485"},{"issue":"4","key":"14_CR28","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980). https:\/\/doi.org\/10.1145\/322217.322225","journal-title":"J. ACM"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Semaev, I., Tenti, A.: Probabilistic analysis on macaulay matrices over finite fields and complexity of constructing gr\u00f6bner bases. J. Algebra 565, 651\u2013674 (2021). https:\/\/doi.org\/10.1016\/j.jalgebra.2020.08.035. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0021869320304737","DOI":"10.1016\/j.jalgebra.2020.08.035"},{"key":"14_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-031-58734-4_13","volume-title":"EUROCRYPT 2024, Part III","author":"MJ Steiner","year":"2024","unstructured":"Steiner, M.J.: The complexity of algebraic algorithms for LWE. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part III. LNCS, vol. 14653, pp. 375\u2013403. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58734-4_13"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"St\u00e4hlin, P.: Subexponential attacks on variational LPN. Master thesis, ETH Zurich, Zurich (2023). https:\/\/doi.org\/10.3929\/ethz-b-000643453","DOI":"10.3929\/ethz-b-000643453"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-55304-3_22","volume-title":"Information Security and Privacy","author":"C Sun","year":"2020","unstructured":"Sun, C., Tibouchi, M., Abe, M.: Revisiting the hardness of binary error LWE. In: Liu, J.K., Cui, H. (eds.) ACISP 2020. LNCS, vol. 12248, pp. 425\u2013444. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55304-3_22"},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for Boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy, pp. 1074\u20131091. IEEE Computer Society Press, May 2021. https:\/\/doi.org\/10.1109\/SP40001.2021.00056","DOI":"10.1109\/SP40001.2021.00056"},{"key":"14_CR34","doi-asserted-by":"publisher","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: fast extension for correlated OT with small communication. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1607\u20131626. ACM Press, November 2020. https:\/\/doi.org\/10.1145\/3372297.3417276","DOI":"10.1145\/3372297.3417276"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"\u00dcnal, A.: Cryptanalysis by algebraic relations. Doctoral thesis, ETH Zurich, Zurich (2024). https:\/\/doi.org\/10.3929\/ethz-b-000679381","DOI":"10.3929\/ethz-b-000679381"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91095-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T05:15:13Z","timestamp":1745730913000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91095-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031910944","9783031910951"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91095-1_14","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":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}