{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:20:58Z","timestamp":1775794858821,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683909","type":"print"},{"value":"9783031683916","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68391-6_6","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T19:02:14Z","timestamp":1723834934000},"page":"183-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Not Just Regular Decoding: Asymptotics and\u00a0Improvements of\u00a0Regular Syndrome Decoding Attacks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5806-3600","authenticated-orcid":false,"given":"Andre","family":"Esser","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0631-3668","authenticated-orcid":false,"given":"Paolo","family":"Santini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"6_CR1","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":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11554868_6","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"D Augot","year":"2005","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A family of fast syndrome based cryptographic hash functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 64\u201383. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554868_6"},{"key":"6_CR3","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":"6_CR4","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":"6_CR5","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 (2018). https:\/\/doi.org\/10.1145\/3243734.3243868","DOI":"10.1145\/3243734.3243868"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 291\u2013308. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3354255","DOI":"10.1145\/3319535.3354255"},{"key":"6_CR7","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":"6_CR8","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":"6_CR9","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, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_14"},{"key":"6_CR10","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, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_19"},{"key":"6_CR11","unstructured":"Carozza, E., Couteau, G., Joux, A.: Short signatures from regular syndrome decoding in the head. Cryptology ePrint Archive, Paper 2023\/1035 (2023). https:\/\/eprint.iacr.org\/2023\/1035"},{"key":"6_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-031-22972-5_17","volume-title":"ASIACRYPT 2022, Part IV","author":"K Carrier","year":"2022","unstructured":"Carrier, K., Debris-Alazard, T., Meyer-Hilfiger, C., Tillich, J.P.: Statistical decoding 2.0: reducing decoding to LPN. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part IV. LNCS, vol. 13794, pp. 477\u2013507. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_17"},{"key":"6_CR13","unstructured":"Cui, H., Liu, H., Yan, D., Yang, K., Yu, Y., Zhang, K.: Resolved: shorter signatures from regular syndrome decoding and vole-in-the-head. Cryptology ePrint Archive, Paper 2024\/040 (2024). https:\/\/eprint.iacr.org\/2024\/040"},{"key":"6_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-47818-5_3","volume-title":"IMACC 2023","author":"A Esser","year":"2023","unstructured":"Esser, A.: Revisiting nearest-neighbor-based information set decoding. In: Quaglia, E.A. (ed.) IMACC 2023. LNCS, vol. 14421, pp. 34\u201354. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47818-5_3"},{"key":"6_CR15","unstructured":"Esser, A., Santini, P.: Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks. IACR Cryptology ePrint Archive, p.\u00a01568 (2023). https:\/\/eprint.iacr.org\/2023\/1568"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Esser, A., Verbel, J., Zweydinger, F., Bellini, E.: CryptographicEstimators: a software library for cryptographic hardness estimation. Cryptology ePrint Archive (2023)","DOI":"10.1145\/3634737.3645007"},{"key":"6_CR17","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":"6_CR18","doi-asserted-by":"crossref","unstructured":"Fulman, J., Goldstein, L.: Stein\u2019s method and the rank distribution of random matrices over finite fields (2015)","DOI":"10.1214\/13-AOP889"},{"key":"6_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":"6_CR20","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"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-13190-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Howgrave-Graham","year":"2010","unstructured":"Howgrave-Graham, N., Joux, A.: New generic algorithms for hard knapsacks. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 235\u2013256. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_12"},{"key":"6_CR22","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":"6_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":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in $$\\tilde{\\cal{O}}(2^{0.054n})$$. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107\u2013124. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_6"},{"key":"6_CR25","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, Part I. LNCS, vol. 9056, pp. 203\u2013228. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_9"},{"issue":"5","key":"6_CR26","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":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-77026-8_1","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"M-JO Saarinen","year":"2007","unstructured":"Saarinen, M.-J.O.: Linearization attacks against syndrome based hashes. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 1\u20139. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77026-8_1"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-29360-8_10","volume-title":"Post-Quantum Cryptography","author":"R Canto Torres","year":"2016","unstructured":"Canto Torres, R., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 144\u2013161. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_10"},{"key":"6_CR29","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 (2020). https:\/\/doi.org\/10.1145\/3372297.3417276","DOI":"10.1145\/3372297.3417276"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68391-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:04:18Z","timestamp":1730214258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68391-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683909","9783031683916"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68391-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 August 2024","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","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":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}