{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T17:12:04Z","timestamp":1775754724289,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"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_6","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:30:06Z","timestamp":1775752206000},"page":"156-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Syndrome Weight Distribution in\u00a0Quasi-Cyclic Codes, Applications to\u00a0BIKE and\u00a0HQC"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Mesnard","sequence":"first","affiliation":[]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[]},{"given":"Valentin","family":"Vasseur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"6_CR1","unstructured":"Aguilar Melchor, C., et al.: BIKE. Round 4 Submission to the NIST Post-Quantum Cryptography Call, v.\u00a05.1 (2022). https:\/\/bikesuite.org"},{"key":"6_CR2","unstructured":"Aguilar Melchor, C., et al.: HQC. Round 4 Submission to the NIST Post-Quantum Cryptography Call (2022). https:\/\/pqc-hqc.org\/"},{"key":"6_CR3","unstructured":"Albrecht, M., et al.: Classic McEliece (merger of Classic McEliece and NTS-KEM). In: Fourth Round Finalist of the NIST Post-Quantum Cryptography Call (2022). https:\/\/classic.mceliece.org"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Annechini, A., Barenghi, A., Pelosi, G.: Bit-flipping decoder failure rate estimation for $$(v, w)-$$regular codes. In: Proceedings of IEEE International Symposium Information Theory - ISIT, pp. 3374\u20133379. IEEE (2024). https:\/\/doi.org\/10.1109\/ISIT57864.2024.10619629","DOI":"10.1109\/ISIT57864.2024.10619629"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Annechini, A., Barenghi, A., Pelosi, G.: Bit-flipping decoder failure rate estimation for $$(v, w)-$$regular codes. CoRR arxiv:2401.16919 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2401.16919","DOI":"10.48550\/ARXIV.2401.16919"},{"key":"6_CR6","unstructured":"Annechini, A., Barenghi, A., Pelosi, G., Perriello, S.: Designing QC-MDPC public key encryption schemes with Niederreiter\u2019s construction and a bit flipping decoder with bounded DFR. IACR Cryptol. ePrint Arch., p.\u00a01043 (2025). https:\/\/eprint.iacr.org\/2025\/1043"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-032-01855-7_8","volume-title":"Advances in Cryptology - CRYPTO 2025","author":"S Arpin","year":"2025","unstructured":"Arpin, S., et al.: Error floor prediction with Markov models for QC-MDPC codes. In: Tauman Kalai, Y., Kamara, S.F. (eds.) Advances in Cryptology - CRYPTO 2025, pp. 221\u2013252. Springer, Cham (2025)"},{"key":"6_CR8","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: LEDAcrypt. In: Second Round Submission to the NIST Post-Quantum Cryptography Call (2019). https:\/\/www.ledacrypt.org"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Baldi, M., Bodrato, M., Chiaraluce, F.: A new analysis of the McEliece cryptosystem based on QC-LDPC codes. In: Proceedings of the 6th International Conference on Security and Cryptography for Networks, SCN \u201908, pp. 246\u2013262. Springer, Cham (2008)","DOI":"10.1007\/978-3-540-85855-3_17"},{"key":"6_CR10","unstructured":"Banegas, G., et al.: DAGS : Key encapsulation for dyadic GS codes. In: First Round Submission to the NIST Post-Quantum Cryptography Call (2017). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/submissions\/DAGS.zip"},{"key":"6_CR11","unstructured":"Barelli, E.: On the security of short McEliece keys from algebraic and algebraic geometry codes with automorphisms. Ph.D. thesis, \u00c9cole Polytechnique X ; Universit\u00e9 Paris Saclay (2018). https:\/\/hal.archives-ouvertes.fr\/tel-01993634"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Barelli, E., Couvreur, A.: An efficient structural attack on NIST submission DAGS. In: Peyrin, T., Galbraith, S. (eds.) Advances in Cryptology - ASIACRYPT\u201918. LNCS, vol. 11272, pp. 93\u2013118. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-030-03326-2_4"},{"key":"6_CR13","unstructured":"Bekessy, A., Bekessy, P., Komlos, J.: Asymptotic enumeration of regular matrices. Studia Scientiarum Mathematicarum Hungarica 7 (1972)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Berger, T.P., Cayrel, P.L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) Progress in Cryptology - AFRICACRYPT\u00a02009. LNCS, vol.\u00a05580, pp. 77\u201397. Gammarth, Tunisia (2009)","DOI":"10.1007\/978-3-642-02384-2_6"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Bombar, M., Couvreur, A., Debris-Alazard, T.: Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology - ASIACRYPT 2023 29th International Conference on the Theory and Application of Cryptology and Information Security. LNCS. Springer, Heidelberg (2023)","DOI":"10.1007\/978-981-99-8739-9_9"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Bombar, M., Resch, N., Wiedijk, E.: On the independence assumption in quasi-cyclic code-based cryptography. IACR Cryptol. ePrint Arch., 18 (2025). https:\/\/eprint.iacr.org\/2025\/018","DOI":"10.1109\/ISIT63088.2025.11195347"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Lyubashevsky, V., Vaikuntanathan, V., Wichs, D.: Worst-case hardness for LPN and cryptographic hashing via code smoothing. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, 19\u201323 May 2019, Proceedings, Part III. LNCS, vol. 11478, pp. 619\u2013635. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_21","DOI":"10.1007\/978-3-030-17659-4_21"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., de\u00a0Portzamparc, F., Tillich, J.P.: Folding alternant and Goppa Codes with non-trivial automorphism groups. IEEE Trans. Inform. Theory 62(1), 184\u2013198 (2016). https:\/\/doi.org\/10.1109\/TIT.2015.2493539","DOI":"10.1109\/TIT.2015.2493539"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., Tillich, J.P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Advances in Cryptology - EUROCRYPT\u00a02010. LNCS, vol.\u00a06110, pp. 279\u2013298 (2010)","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"6_CR20","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), pp. 81\u201391. Bergen, Norway (2005)"},{"key":"6_CR21","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low Density Parity Check Codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R.G.: Low Density Parity Check Codes. M.I.T. Press, Cambridge (1963)"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Theory of Cryptography Conference, pp. 341\u2013371. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12","DOI":"10.1007\/978-3-319-70500-2_12"},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1109\/18.992777","volume":"48","author":"S Litsyn","year":"2002","unstructured":"Litsyn, S., Shevelev, V.: On ensembles of low-density parity-check codes: asymptotic distance distributions. IEEE Trans. Inf. Theory 48(4), 887\u2013908 (2002). https:\/\/doi.org\/10.1109\/18.992777","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Advances in Cryptology - EUROCRYPT2010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"6_CR25","unstructured":"McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114\u2013116. Jet Propulsion Lab (1978). dSN Progress Report 42-44"},{"key":"6_CR26","unstructured":"Mesnard, A., Tillich, J.P., Vasseur, V.: The syndrome weight distribution in quasi-cyclic codes, applications to BIKE and HQC. Cryptology ePrint Archive, Paper 2025\/2218 (2025). https:\/\/eprint.iacr.org\/2025\/2218"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Barreto, P.: Compact McEliece keys from Goppa codes. In: Selected Areas in Cryptography, Calgary, Canada (2009)","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Misoczki, R., Tillich, J.P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: Proceedings of IEEE International Symposium Information Theory - ISIT, pp. 2069\u20132073 (2013). https:\/\/doi.org\/10.1109\/ISIT.2013.6620590","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Peikert, C., Regev, O., Stephens-Davidowitz, N.: Pseudorandomness of ring-LWE for any ring and modulus. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 461\u2013473 (2017)","DOI":"10.1145\/3055399.3055489"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 84\u201393 (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Richardson, T., Urbanke, R.: Modern Coding Theory. Cambridge University Press, Cambridge (2008). http:\/\/www.cambridge.org\/de\/knowledge\/isbn\/item1172874\/","DOI":"10.1017\/CBO9780511791338"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Rosca, M., Stehl\u00e9, D., Wallet, A.: On the ring-LWE and polynomial-LWE problems. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 146\u2013173. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-319-78381-9_6"},{"key":"6_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-25510-7_22","volume-title":"Post-Quantum Cryptography 2019","author":"N Sendrier","year":"2019","unstructured":"Sendrier, N., Vasseur, V.: On the decoding failure rate of QC-MDPC bit-flipping decoders. In: Ding, J., Steinwandt, R. (eds.) Post-Quantum Cryptography 2019. LNCS, vol. 11505, pp. 404\u2013416. Springer, Chongquing (2019)"},{"key":"6_CR34","doi-asserted-by":"publisher","unstructured":"Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inform. Theory 27(5), 533\u2013547 (1981). https:\/\/doi.org\/10.1109\/TIT.1981.1056404","DOI":"10.1109\/TIT.1981.1056404"},{"key":"6_CR35","unstructured":"Vasseur, V.: Post-quantum cryptography: a study of the decoding of QC-MDPC codes. Thesis, Universit\u00e9 de Paris (2021). https:\/\/tel.archives-ouvertes.fr\/tel-03254461"},{"key":"6_CR36","doi-asserted-by":"publisher","unstructured":"Yu, Y., Zhang, J.: Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, 16\u201320 August 2021, Proceedings, Part III. LNCS, vol. 12827, pp. 473\u2013501. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_16","DOI":"10.1007\/978-3-030-84252-9_16"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:30:10Z","timestamp":1775752210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22695-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032226945","9783032226952"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22695-2_6","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"}}]}}