{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T17:11:52Z","timestamp":1775754712283,"version":"3.50.1"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032226945","type":"print"},{"value":"9783032226952","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-22695-2_7","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:29:53Z","timestamp":1775752193000},"page":"188-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cross-Paradigm Models of\u00a0Restricted Syndrome Decoding with\u00a0Application to\u00a0CROSS"],"prefix":"10.1007","author":[{"given":"\u00c9tienne","family":"Burle","sequence":"first","affiliation":[]},{"given":"Aleksei","family":"Udovenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"7_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":"7_CR2","unstructured":"Alagic, G., et al.: Status report on the first round of the additional digital signature schemes for the NIST post-quantum cryptography standardization process. Technical report, National Institute of Standards and Technology (2024). https:\/\/csrc.nist.gov\/pubs\/ir\/8528\/final, nIST Internal Report 8528"},{"key":"7_CR3","doi-asserted-by":"publisher","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","DOI":"10.1007\/11554868_6"},{"key":"7_CR4","unstructured":"Baldi, M., et al.: CROSS \u2014 Codes and Restricted Objects Signature Scheme. Security Details. Version 2.2 - July 31, 2025. Technical report (2024)"},{"key":"7_CR5","unstructured":"Baldi, M., et al.: CROSS \u2014 Codes and Restricted Objects Signature Scheme. Technical report, National Institute of Standards and Technology (2024). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-2-additional-signatures"},{"issue":"5","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.3934\/amc.2024058","volume":"19","author":"M Baldi","year":"2025","unstructured":"Baldi, M.: A new path to code-based signatures via identification schemes with restricted errors. Adv. Math. Commun. 19(5), 1360\u20131381 (2025). https:\/\/doi.org\/10.3934\/amc.2024058","journal-title":"Adv. Math. Commun."},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Baldi, M., et al.: A new path to code-based signatures via identification schemes with restricted errors (2021). https:\/\/doi.org\/10.48550\/arXiv.2008.06403","DOI":"10.48550\/arXiv.2008.06403"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Baldi, M., Bitzer, S., Pavoni, A., Santini, P., Wachter-Zeh, A., Weger, V.: Zero knowledge protocols and signatures from the restricted syndrome decoding problem. In: Tang, Q., Teague, V. (eds.) PKC\u00a02024, Part\u00a0II. LNCS, vol. 14602, pp. 243\u2013274. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_8","DOI":"10.1007\/978-3-031-57722-2_8"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Barg, A.: Minimum distance decoding algorithms for linear codes. In: Mora, T., Mattson, H. (eds.) AAECC 1997. LNCS, vol. 1255, pp. 1\u201314. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63163-1_1","DOI":"10.1007\/3-540-63163-1_1"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Krauthgamer, R. (ed.) 27th SODA, pp. 10\u201324. ACM-SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch2","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in $$2^{n\/20}$$: how $$1+1=0$$ improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31","DOI":"10.1007\/978-3-642-29011-4_31"},{"issue":"3","key":"7_CR12","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. Inform. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO\u00a02011. LNCS, vol.\u00a06841, pp. 743\u2013760. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_42","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Beullens, W., Briaud, P., \u00d8ygarden, M.: A security analysis of restricted syndrome decoding problems. CiC 1(3), 33 (2024). https:\/\/doi.org\/10.62056\/a06cy7qiu","DOI":"10.62056\/a06cy7qiu"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Bitzer, S., Pavoni, A., Weger, V., Santini, P., Baldi, M., Wachter-Zeh, A.: Generic decoding of restricted errors. In: IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, June 25\u201330, 2023, pp. 246\u2013251. IEEE (2023). https:\/\/doi.org\/10.1109\/ISIT54713.2023.10206983","DOI":"10.1109\/ISIT54713.2023.10206983"},{"key":"7_CR16","unstructured":"Both, L., May, A.: Optimizing BJMM with nearest neighbors: full decoding in $$2^{2\/21 n}$$ and McEliece security. In: WCC Workshop on Coding and Cryptography (2017). http:\/\/wcc2017.suai.ru\/Proceedings_WCC2017.zip"},{"key":"7_CR17","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-319-79063-3_2"},{"key":"7_CR18","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: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 391\u2013422. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_14","DOI":"10.1007\/978-3-031-30589-4_14"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Bricout, R., Chailloux, A., Debris-Alazard, T., Lequesne, M.: Ternary syndrome decoding with large weight. In: Paterson, K.G., Stebila, D. (eds.) SAC 2019. LNCS, vol. 11959, pp. 437\u2013466. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-38471-5_18","DOI":"10.1007\/978-3-030-38471-5_18"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Burle, E., Udovenko, A.: Cross-paradigm models of restricted syndrome decoding with application to CROSS - supporting code (2026). https:\/\/doi.org\/10.5281\/zenodo.18230686","DOI":"10.5281\/zenodo.18230686"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Carozza, E., Couteau, G., Joux, A.: Short signatures from regular syndrome decoding in the head. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 532\u2013563. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_19","DOI":"10.1007\/978-3-031-30589-4_19"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Debris-Alazard, T., Tillich, J.P.: Statistical decoding. In: Proceedings of the IEEE International Symposium Information Theory - ISIT\u00a02017, pp. 1798\u20131802. Aachen, Germany (2017)","DOI":"10.1109\/ISIT.2017.8006839"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Ducas, L., Laarhoven, T., van Woerden, W.P.J.: The randomized slicer for CVPP: Sharper, faster, smaller, batchier. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC\u00a02020, Part\u00a0II. LNCS, vol. 12111, pp. 3\u201336. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_1","DOI":"10.1007\/978-3-030-45388-6_1"},{"key":"7_CR24","unstructured":"Dumer, I.: On minimum distance decoding of linear codes. In: Proceedings of the 5th Joint Soviet-Swedish International Workshop Information Theory, pp. 50\u201352. Moscow (1991)"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Esser, A., Santini, P.: Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VI. LNCS, vol. 14925, pp. 183\u2013217. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68391-6_6","DOI":"10.1007\/978-3-031-68391-6_6"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Fincke, U., Pohst, M.: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math. Comput. 44(170), 463\u2013471 (1985). http:\/\/www.jstor.org\/stable\/2007966","DOI":"10.1090\/S0025-5718-1985-0777278-8"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT\u00a02009. LNCS, vol.\u00a05912, pp. 88\u2013105. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_6","DOI":"10.1007\/978-3-642-10366-7_6"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT\u00a02008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) EUROCRYPT\u00a02010. LNCS, vol.\u00a06110, pp. 257\u2013278. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13","DOI":"10.1007\/978-3-642-13190-5_13"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-20901-7_10","volume-title":"Coding and Cryptology","author":"G Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Algorithms for the shortest and closest lattice vector problems. In: Chee, Y.M., et al. (eds.) Coding and Cryptology, pp. 159\u2013190. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_10"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Hazay, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Concretely efficient large-scale MPC with active security (or, TinyKeys for TinyOT). In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT\u00a02018, Part\u00a0III. LNCS, vol. 11274, pp. 86\u2013117. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_4","DOI":"10.1007\/978-3-030-03332-3_4"},{"key":"7_CR32","unstructured":"Horlemann, A.L., Khathuria, K., Newman, M., Sakzad, A., Cabello, C.V.: Lattice-based vulnerabilities in lee metric post-quantum cryptosystems. Cryptology ePrint Archive, Report 2024\/1495 (2024). https:\/\/eprint.iacr.org\/2024\/1495"},{"key":"7_CR33","unstructured":"H\u00fclsing, A., et al.: SPHINCS+. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Jabri, A.A.: A statistical decoding algorithm for general linear block codes. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol.\u00a02260, pp.\u00a01\u20138. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45325-3_1","DOI":"10.1007\/3-540-45325-3_1"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: 15th ACM STOC, pp. 193\u2013206. ACM Press (1983). https:\/\/doi.org\/10.1145\/800061.808749","DOI":"10.1145\/800061.808749"},{"key":"7_CR36","unstructured":"Kim, J., Lee, C.: Reduce and Prange: revisiting Prange\u2019s information set decoding for LPN and RSD. IACR Cryptol. ePrint Arch. p.\u00a0276 (2024). https:\/\/eprint.iacr.org\/2024\/276"},{"issue":"4","key":"7_CR37","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"7_CR38","doi-asserted-by":"publisher","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\u00a02024, Part\u00a0VI. LNCS, vol. 14656, pp. 149\u2013179. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_6","DOI":"10.1007\/978-3-031-58751-1_6"},{"key":"7_CR39","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"7_CR40","doi-asserted-by":"publisher","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT\u00a02015. LNCS, vol.\u00a09056, pp. 203\u2013228. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_9","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"7_CR41","unstructured":"McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114\u2013116. Jet Propulsion Lab (1978). dSN Progress Report 44"},{"key":"7_CR42","doi-asserted-by":"publisher","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Transactions on Information Theory 8(5), 5\u20139 (1962). https:\/\/doi.org\/10.1109\/TIT.1962.1057777","DOI":"10.1109\/TIT.1962.1057777"},{"key":"7_CR43","unstructured":"Prest, T., et al.: FALCON. Technical report, National Institute of Standards and Technology (2022), available at https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"7_CR44","doi-asserted-by":"publisher","unstructured":"Saarinen, M.J.O.: Linearization attacks against syndrome based hashes. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT\u00a02007. LNCS, vol.\u00a04859, pp.\u00a01\u20139. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77026-8_1","DOI":"10.1007\/978-3-540-77026-8_1"},{"key":"7_CR45","unstructured":"Sage\u00a0Developers, T.: SageMath, the Sage Mathematics Software System (Version 10.6) (2025),. https:\/\/www.sagemath.org"},{"key":"7_CR46","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(1), 181\u2013199 (1994). https:\/\/doi.org\/10.1007\/BF01581144","DOI":"10.1007\/BF01581144"},{"key":"7_CR47","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"CP Schnorr","year":"2003","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003, vol. 2607, pp. 145\u2013156. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_14"},{"key":"7_CR48","unstructured":"Schwabe, P., et al.: CRYSTALS-KYBER. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Goldwasser, S. (ed.) FOCS, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"7_CR50","doi-asserted-by":"publisher","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G.D., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol.\u00a0388, pp. 106\u2013113. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0019850","DOI":"10.1007\/BFb0019850"},{"key":"7_CR51","unstructured":"development team, T.F.: FPYLLL, a Python wrapper for the FPLLL lattice reduction library, Version: 0.6.4 (2025). https:\/\/github.com\/fplll\/fpylll"},{"key":"7_CR52","unstructured":"Wang, T., et al.: A hybrid algorithm for the regular syndrome decoding problem. IACR Cryptol. ePrint Arch. p.\u00a01284 (2025). https:\/\/eprint.iacr.org\/2025\/1284"}],"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-032-22695-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:29:56Z","timestamp":1775752196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22695-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032226945","9783032226952"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22695-2_7","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":"10 April 2026","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":"Saint-Malo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}