{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:03:54Z","timestamp":1771326234365,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865985","type":"print"},{"value":"9783031865992","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-86599-2_2","type":"book-chapter","created":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:58:44Z","timestamp":1742842724000},"page":"35-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quadratic Modelings of\u00a0Syndrome Decoding"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Caminata","sequence":"first","affiliation":[]},{"given":"Ryann","family":"Cartor","sequence":"additional","affiliation":[]},{"given":"Alessio","family":"Meneghetti","sequence":"additional","affiliation":[]},{"given":"Rocco","family":"Mora","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Pellegrini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(97)00064-9","volume":"187","author":"B Amrhein","year":"1997","unstructured":"Amrhein, B., Gloor, O., K\u00fcchlin, W.: On the walk. Theor. Comput. Sci. 187(1), 179\u2013202 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR2","unstructured":"Aragon, N., et\u00a0al.: BIKE: bit flipping key encapsulation (2022)"},{"key":"2_CR3","unstructured":"Bardet, M.: \u00c9tude des syst\u00e8mes alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e0 la cryptographie. Ph.D. thesis, Universit\u00e9 Pierre et Marie Curie-Paris VI (2004)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-45727-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., et al.: An algebraic attack on rank metric code-based cryptosystems. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_3"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-030-64837-4_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., et al.: Improvements of algebraic attacks for solving the rank decoding and minrank problems. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 507\u2013536. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_17"},{"key":"2_CR6","unstructured":"Bardet, M., Faugere, J.C., Salvy, B.: On the complexity of Gr\u00f6bner basis computation of semi-regular overdetermined algebraic equations. In: Proceedings of the International Conference on Polynomial System Solving, pp. 71\u201374 (2004)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in 2n\/20: how 1\u2009+\u20091\u2009=\u20090 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Berlekamp, E., McEliece, R., Van\u00a0Tilborg, H.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Info. Theory 24(3), 384\u2013386 (1978)","DOI":"10.1109\/TIT.1978.1055873"},{"key":"2_CR9","unstructured":"Bernstein, D.J., et\u00a0al.: Classic McEliece: conservative code-based cryptography. ffhal-04288769 (2017)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 743\u2013760. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_42"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-030-77700-5_3","volume":"24","author":"M Bigdeli","year":"2021","unstructured":"Bigdeli, M., De Negri, E., Dizdarevic, M.M., Gorla, E., Minko, R., Tsakou, S.: Semi-regular sequences and other random systems of equations. Assoc. Women Math. Ser. 24, 75\u2013114 (2021)","journal-title":"Assoc. Women Math. Ser."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-79063-3_2","volume-title":"Post-Quantum Cryptography","author":"L Both","year":"2018","unstructured":"Both, L., May, A.: Decoding linear codes with high error rate and its impact for LPN security. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 25\u201346. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_2"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Briaud, P., \u00d8ygarden, M.: A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions. In: EUROCRYPT (5). Lecture Notes in Computer Science, vol. 14008, pp. 391\u2013422. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_14","DOI":"10.1007\/978-3-031-30589-4_14"},{"key":"2_CR14","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. Symb. Comput. 41(3-4), 475\u2013511 (2006)","DOI":"10.1016\/j.jsc.2005.09.007"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-68869-1_1","volume-title":"Arithmetic of Finite Fields","author":"A Caminata","year":"2021","unstructured":"Caminata, A., Gorla, E.: Solving multivariate polynomial systems and an invariant from commutative algebra. In: Bajard, J.C., Topuzo\u011flu, A. (eds.) WAIFI 2020. LNCS, vol. 12542, pp. 3\u201336. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68869-1_1"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.jsc.2022.05.001","volume":"114","author":"A Caminata","year":"2023","unstructured":"Caminata, A., Gorla, E.: Solving degree, last fall degree, and related invariants. J. Symb. Comput. 114, 322\u2013335 (2023)","journal-title":"J. Symb. Comput."},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Carrier, K., Debris-Alazard, T., Meyer-Hilfiger, C., Tillich, J.P.: Statistical decoding 2.0: reducing decoding to LPN. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 477\u2013507. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_17","DOI":"10.1007\/978-3-031-22972-5_17"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Carrier, K., Debris-Alazard, T., Meyer-Hilfiger, C., Tillich, J.P.: Reduction from sparse LPN to LPN, dual attack 3.0. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 286\u2013315. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58754-2_11","DOI":"10.1007\/978-3-031-58754-2_11"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1006\/jsco.1996.0145","volume":"24","author":"S Collart","year":"1997","unstructured":"Collart, S., Kalkbrener, M., Mall, D.: Converting bases with the Gr\u00f6bner walk. J. Symb. Comput. 24(3), 465\u2013469 (1997)","journal-title":"J. Symb. Comput."},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"N Courtois","year":"2000","unstructured":"Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392\u2013407. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_27"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Cox, D., Little, J., O\u2019shea, D., Sweedler, M.: Ideals, Varieties, and Algorithms, vol.\u00a03. Springer, Heidelberg (1997)","DOI":"10.1007\/978-1-4757-2693-0"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-42001-6_4","volume-title":"Number Theory and Cryptography","author":"J Ding","year":"2013","unstructured":"Ding, J., Schmidt, D.: Solving degree and degree of regularity for polynomial systems over a finite fields. In: Fischlin, M., Katzenbeisser, S. (eds.) Number Theory and Cryptography. LNCS, vol. 8260, pp. 34\u201349. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42001-6_4"},{"issue":"1","key":"2_CR23","first-page":"17","volume":"25","author":"I Dumer","year":"1989","unstructured":"Dumer, I.: Two decoding algorithms for linear codes. Problemy Peredachi Informatsii 25(1), 17\u201323 (1989)","journal-title":"Problemy Peredachi Informatsii"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Esser, A., Bellini, E.: Syndrome decoding estimator. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC\u00a02022: 25th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I. Lecture Notes in Computer Science, vol. 13177, pp. 112\u2013141. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_5","DOI":"10.1007\/978-3-030-97121-2_5"},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"JC Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J.C., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993)","journal-title":"J. Symb. Comput."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases $$(F_4)$$. J. Pure Appl. Algebra 139, 61\u201388 (1999)","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5), pp. 75\u201383 (2002)","DOI":"10.1145\/780506.780516"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88\u2013105. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_6"},{"key":"2_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to Finite Fields and their Applications","author":"R Lidl","year":"1994","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and their Applications, 2nd edn. Cambridge University Press, Cambridge (1994)","edition":"2"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in $$O(2^{0.054n})$$. In: Lee, D.H., Wang, X. (eds.) 2011, vol.\u00a07073, pp. 107\u2013124. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-46800-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A May","year":"2015","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 203\u2013228. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_9"},{"key":"2_CR32","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Coding Thv 4244, 114\u2013116 (1978)","journal-title":"Coding Thv"},{"issue":"4","key":"2_CR33","first-page":"13","volume":"2","author":"CA Melchor","year":"2018","unstructured":"Melchor, C.A., et al.: Hamming quasi-cyclic (HQC). NIST PQC Round 2(4), 13 (2018)","journal-title":"NIST PQC Round"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Meneghetti, A., Pellegrini, A., Sala, M.: On the equivalence of two post-quantum cryptographic families. Annali di Matematica Pura ed Applicata (1923 -) 202, 967\u2013991 (2023)","DOI":"10.1007\/s10231-022-01267-x"},{"issue":"5","key":"2_CR35","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"2_CR36","unstructured":"Salizzoni, F.: An upper bound for the solving degree in terms of the degree of regularity. arXiv:2304.13485 (2023)"},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.jalgebra.2020.08.035","volume":"565","author":"I Semaev","year":"2021","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)","journal-title":"J. Algebra"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J Stern","year":"1989","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0019850"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86599-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:58:49Z","timestamp":1742842729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86599-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865985","9783031865992"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86599-2_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":"15 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2025.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}