{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T12:45:33Z","timestamp":1769517933778,"version":"3.49.0"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031464942","type":"print"},{"value":"9783031464959","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-46495-9_4","type":"book-chapter","created":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T06:02:56Z","timestamp":1698386576000},"page":"56-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["FuLeeca: A Lee-Based Signature Scheme"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Ritterhoff","sequence":"first","affiliation":[]},{"given":"Georg","family":"Maringer","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Bitzer","sequence":"additional","affiliation":[]},{"given":"Violetta","family":"Weger","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Karl","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Schamberger","sequence":"additional","affiliation":[]},{"given":"Jonas","family":"Schupp","sequence":"additional","affiliation":[]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,28]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor, C., Gama, N., Howe, J., H\u00fclsing, A., Joseph, D., Yue, D.: The return of the SDitH. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/978-3-030-17659-4_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"N Aragon","year":"2019","unstructured":"Aragon, N., Blazy, O., Gaborit, P., Hauteville, A., Z\u00e9mor, G.: Durandal: a rank metric based signature scheme. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 728\u2013758. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_25"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Aragon, N., Dyseryn, V., Gaborit, P.: Analysis of the security of the PSSI problem and cryptanalysis of the Durandal signature scheme. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-38548-3_5"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0166-218X(84)90074-X","volume":"8","author":"J Astola","year":"1984","unstructured":"Astola, J.: On the asymptotic behaviour of Lee-codes. Discret. Appl. Math. 8(1), 13\u201323 (1984)","journal-title":"Discret. Appl. Math."},{"key":"4_CR5","unstructured":"Aumasson, J.P., et al.: $$\\text{SPHINCS}^+$$, submission to the NIST post-quantum project, vol. 3 (2020). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38616-9_1","volume-title":"Post-Quantum Cryptography","author":"M Baldi","year":"2013","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., Schipani, D.: Using LDGM codes and sparse syndromes to achieve digital signatures. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 1\u201315. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_1"},{"key":"4_CR7","doi-asserted-by":"crossref","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. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-57722-2_8"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-81293-5_2","volume-title":"Post-Quantum Cryptography","author":"A Barenghi","year":"2021","unstructured":"Barenghi, A., Biasse, J.-F., Persichetti, E., Santini, P.: LESS-FM: fine-tuning signatures from the code equivalence problem. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 23\u201343. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_2"},{"key":"4_CR9","unstructured":"Barg, A.: Complexity issues in coding theory. Technical report TR97-046, Electronic Colloquium on Computational Complexity (ECCC) (1997). https:\/\/eccc.weizmann.ac.il\/eccc-reports\/1997\/TR97-046\/index.html. ISSN 1433-8092"},{"key":"4_CR10","unstructured":"Barg, A.: Some new NP-complete coding problems. Problemy Peredachi Informatsii 30(3), 23\u201328 (1994). https:\/\/www.mathnet.ru\/eng\/ppi241"},{"key":"4_CR11","unstructured":"Bariffi, J., Bartz, H., Liva, G., Rosenthal, J.: On the properties of error patterns in the constant Lee weight channel. In: International Zurich Seminar on Information and Communication (IZS 2022) Proceedings, pp. 44\u201348. ETH Zurich (2022)"},{"key":"4_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-031-29689-5_7","volume-title":"Code-Based Cryptography","author":"J Bariffi","year":"2022","unstructured":"Bariffi, J., Khathuria, K., Weger, V.: Information set decoding for Lee-metric codes using restricted balls. In: Deneuville, J.C. (ed.) CBCrypto 2022. LNCS, vol. 13839, pp. 110\u2013136. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-29689-5_7"},{"key":"4_CR13","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 $$2^{n\/20}$$: how 1+1=0 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":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures-how to sign with RSA and Rabin. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399\u2013416. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_34"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-12929-2_6","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2010","unstructured":"Bernstein, D.J.: Grover vs.\u00a0McEliece. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 73\u201380. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_6"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-45727-3_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"W Beullens","year":"2020","unstructured":"Beullens, W.: Sigma protocols for MQ, PKP and SIS, and fishy signature schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 183\u2013211. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_7"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Bhattacharyya, M., Raina, A.: A quantum algorithm for syndrome decoding of classical error-correcting linear block codes. In: 2022 IEEE\/ACM 7th Symposium on Edge Computing (SEC), pp. 456\u2013461 (2022). https:\/\/doi.org\/10.1109\/SEC54971.2022.00069","DOI":"10.1109\/SEC54971.2022.00069"},{"key":"4_CR19","unstructured":"Bidoux, L., Gaborit, P.: Shorter signatures from proofs of knowledge for the SD, MQ, PKP and RSD problems. arXiv preprint arXiv:2204.02915 (2022)"},{"issue":"18","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1016\/j.tcs.2008.12.045","volume":"410","author":"J Bl\u00f6mer","year":"2009","unstructured":"Bl\u00f6mer, J., Naewe, S.: Sampling methods for shortest vectors, closest vectors and successive minima. Theoret. Comput. Sci. 410(18), 1648\u20131665 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2022.06.013","volume":"651","author":"E Byrne","year":"2022","unstructured":"Byrne, E., Horlemann, A.L., Khathuria, K., Weger, V.: Density of free modules over finite chain rings. Linear Algebra Appl. 651, 1\u201325 (2022)","journal-title":"Linear Algebra Appl."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Chailloux, A., Debris-Alazard, T., Etinski, S.: Classical and Quantum algorithms for generic Syndrome Decoding problems and applications to the Lee metric (2021). https:\/\/eprint.iacr.org\/2021\/552. Report Number: 552","DOI":"10.1007\/978-3-030-81293-5_3"},{"key":"4_CR23","unstructured":"Cho, J., No, J.S., Lee, Y., Koo, Z., Kim, Y.S.: Enhanced pqsigRM: code-based digital signature scheme with short signature and fast verification for post-quantum cryptography. Cryptology ePrint Archive (2022)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NT Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157\u2013174. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_10"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-56880-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Dachman-Soled","year":"2020","unstructured":"Dachman-Soled, D., Ducas, L., Gong, H., Rossi, M.: LWE with side information: attacks and concrete security estimation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-34578-5_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"T Debris-Alazard","year":"2019","unstructured":"Debris-Alazard, T., Sendrier, N., Tillich, J.-P.: Wave: a new family of trapdoor one-way preimage sampleable functions based on codes. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 21\u201351. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_2"},{"issue":"9","key":"4_CR27","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1007\/s10623-020-00737-8","volume":"88","author":"J-C Deneuville","year":"2020","unstructured":"Deneuville, J.-C., Gaborit, P.: Cryptanalysis of a code-based one-time signature. Des. Codes Crypt. 88(9), 1857\u20131866 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00737-8","journal-title":"Des. Codes Crypt."},{"key":"4_CR28","unstructured":"Ducas, L., et al.: Crystals-dilithium - algorithm specifications and supporting documentation (version 3.1) (2021). https:\/\/pq-crystals.org\/dilithium\/resources.shtml"},{"issue":"1","key":"4_CR29","first-page":"24","volume":"25","author":"II Dumer","year":"1989","unstructured":"Dumer, I.I.: Two decoding algorithms for linear codes. Problemy Peredachi Informatsii 25(1), 24\u201332 (1989)","journal-title":"Problemy Peredachi Informatsii"},{"key":"4_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-031-15979-4_9","volume-title":"Advances in Cryptology","author":"T Espitau","year":"2022","unstructured":"Espitau, T., Tibouchi, M., Wallet, A., Yu, Y.: Shorter hash-and-sign lattice-based signatures. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 245\u2013275. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_9"},{"issue":"10","key":"4_CR31","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"JC Faugere","year":"2013","unstructured":"Faugere, J.C., Gauthier-Umana, V., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high-rate McEliece cryptosystems. IEEE Trans. Inf. Theory 59(10), 6830\u20136844 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR32","unstructured":"Feneuil, T.: Building MPCitH-based signatures from MQ, MinRank. Rank SD and PKP. Cryptology ePrint Archive (2022)"},{"key":"4_CR33","first-page":"1","volume":"91","author":"T Feneuil","year":"2022","unstructured":"Feneuil, T., Joux, A., Rivain, M.: Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature. Des. Codes Cryptogr. 91, 1\u201346 (2022)","journal-title":"Des. Codes Cryptogr."},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Feneuil, T., Joux, A., Rivain, M.: Syndrome decoding in the head: Shorter signatures from zero-knowledge proofs. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-15979-4_19"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"4_CR36","unstructured":"Fouque, P.A., et al.: FALCON: fast-fourier lattice-based compact signatures over NTRU, specification v1.2 (2020). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0034343","volume-title":"Algebraic Coding","author":"D Gardy","year":"1992","unstructured":"Gardy, D., Sol\u00e9, P.: Saddle point techniques in asymptotic coding theory. In: Cohen, G., Lobstein, A., Z\u00e9mor, G., Litsyn, S. (eds.) Algebraic Coding 1991. LNCS, vol. 573, pp. 75\u201381. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0034343"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-44987-6_12","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"C Gentry","year":"2001","unstructured":"Gentry, C.: Key recovery and message attacks on NTRU-composite. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 182\u2013194. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_12"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"4_CR40","unstructured":"Gligoroski, D., Samardjiska, S., Jacobsen, H., Bezzateev, S.: McEliece in the world of Escher. Cryptology ePrint Archive (2014)"},{"issue":"1","key":"4_CR41","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3390\/cryptography6010005","volume":"6","author":"S Gueron","year":"2022","unstructured":"Gueron, S., Persichetti, E., Santini, P.: Designing a practical code-based signature scheme from zero-knowledge proofs with trusted setup. Cryptography 6(1), 5 (2022)","journal-title":"Cryptography"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"Horlemann-Trautmann, A.L., Weger, V.: Information set decoding in the Lee metric with applications to cryptography. Adv. Math. Commun. 15(4) (2021)","DOI":"10.3934\/amc.2020089"},{"key":"4_CR43","unstructured":"Jang, K., Baksi, A., Kim, H., Song, G., Seo, H., Chattopadhyay, A.: Quantum analysis of AES. Cryptology ePrint Archive (2022)"},{"key":"4_CR44","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10623-015-0099-x","volume":"80","author":"C L\u00f6ndahl","year":"2016","unstructured":"L\u00f6ndahl, C., Johansson, T., Koochak Shooshtari, M., Ahmadian-Attari, M., Aref, M.R.: Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension. Des. Codes Crypt. 80, 359\u2013377 (2016)","journal-title":"Des. Codes Crypt."},{"key":"4_CR45","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":"4_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-29360-8_8","volume-title":"Post-Quantum Cryptography","author":"D Moody","year":"2016","unstructured":"Moody, D., Perlner, R.: Vulnerabilities of \u201cMcEliece in the world of escher\u2019\u2019. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 104\u2013117. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_8"},{"issue":"4","key":"4_CR47","doi-asserted-by":"publisher","first-page":"30","DOI":"10.3390\/cryptography2040030","volume":"2","author":"E Persichetti","year":"2018","unstructured":"Persichetti, E.: Efficient one-time signatures from quasi-cyclic codes: a full treatment. Cryptography 2(4), 30 (2018)","journal-title":"Cryptography"},{"key":"4_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-29360-8_7","volume-title":"Post-Quantum Cryptography","author":"A Phesso","year":"2016","unstructured":"Phesso, A., Tillich, J.-P.: An efficient attack on a code-based signature scheme. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 86\u2013103. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_7"},{"issue":"5","key":"4_CR49","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":"4_CR50","doi-asserted-by":"crossref","unstructured":"Regev, O., Rosen, R.: Lattice problems and norm embeddings. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 447\u2013456 (2006)","DOI":"10.1145\/1132516.1132581"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"Santini, P., Baldi, M., Chiaraluce, F.: Cryptanalysis of a one-time code-based digital signature scheme. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 2594\u20132598. IEEE (2019)","DOI":"10.1109\/ISIT.2019.8849244"},{"key":"4_CR52","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"4_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-25405-5_4","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2011","unstructured":"Sendrier, N.: Decoding one out of many. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 51\u201367. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_4"},{"key":"4_CR54","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. Technical report (2015). https:\/\/doi.org\/10.6028\/nist.fips.202","DOI":"10.6028\/nist.fips.202"},{"key":"4_CR55","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume":"388","author":"J Stern","year":"1989","unstructured":"Stern, J.: A method for finding codewords of small weight. Coding Theory Appl. 388, 106\u2013113 (1989)","journal-title":"Coding Theory Appl."},{"key":"4_CR56","doi-asserted-by":"publisher","unstructured":"Weger, V., Khathuria, K., Horlemann, A.L., Battaglioni, M., Santini, P., Persichetti, E.: On the hardness of the Lee syndrome decoding problem. Adv. Math. Commun. (2022). https:\/\/doi.org\/10.3934\/amc.2022029. https:\/\/www.aimsciences.org\/en\/article\/doi\/10.3934\/amc.2022029","DOI":"10.3934\/amc.2022029"}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46495-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T22:29:20Z","timestamp":1730413760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46495-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031464942","9783031464959"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46495-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cb-crypto.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}