{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T23:05:23Z","timestamp":1783465523098,"version":"3.55.0"},"publisher-location":"Cham","reference-count":50,"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_3","type":"book-chapter","created":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T06:02:56Z","timestamp":1698386576000},"page":"35-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Theoretical Analysis of\u00a0Decoding Failure Rate of\u00a0Non\u2013binary QC\u2013MDPC Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7893-655X","authenticated-orcid":false,"given":"Kirill","family":"Vedenev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1491-524X","authenticated-orcid":false,"given":"Yury","family":"Kosolapov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Alagic, G., et al.: Status report on the third round of the NIST post-quantum cryptography standardization process. US Department of Commerce, NIST (2022). https:\/\/doi.org\/10.6028\/NIST.IR.8413","DOI":"10.6028\/NIST.IR.8413"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-030-56877-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Apon","year":"2020","unstructured":"Apon, D., Perlner, R., Robinson, A., Santini, P.: Cryptanalysis of LEDAcrypt. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 389\u2013418. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_14"},{"key":"3_CR3","unstructured":"Aragon, N., et al.: Bike: bit flipping key encapsulation. bikesuite.org"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-031-17234-2_5","volume-title":"Post-Quantum Cryptography","author":"S Arpin","year":"2022","unstructured":"Arpin, S., Billingsley, T.R., Hast, D.R., Lau, J.B., Perlner, R., Robinson, A.: A study of error floor behavior in QC-MDPC codes. In: Cheon, J.H., Johansson, T. (eds.) Post-Quantum Cryptography. Lecture Notes in Computer Science, vol. 13512, pp. 89\u2013103. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17234-2_5"},{"key":"3_CR5","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-90428-9_7","volume-title":"E-Business and Telecommunications","author":"M Baldi","year":"2021","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: Analysis of in-place randomized bit-flipping decoders for the design of LDPC and MDPC code-based cryptosystems. In: Obaidat, M.S., Ben-Othman, J. (eds.) ICETE 2020. CCIS, vol. 1484, pp. 151\u2013174. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90428-9_7"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-030-98365-9_6","volume-title":"Code-Based Cryptography","author":"M Baldi","year":"2022","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: Performance bounds for QC-MDPC codes decoders. In: Wachter-Zeh, A., Bartz, H., Liva, G. (eds.) Code-Based Cryptography. Lecture Notes in Computer Science, vol. 13150, pp. 95\u2013122. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-98365-9_6"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-014-9187-8","volume":"29","author":"M Baldi","year":"2014","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., Schipani, D.: Enhanced public key security for the McEliece cryptosystem. J. Cryptol. 29(1), 1\u201327 (2014). https:\/\/doi.org\/10.1007\/s00145-014-9187-8","journal-title":"J. Cryptol."},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","volume-title":"Security and Cryptography for Networks","author":"M Baldi","year":"2008","unstructured":"Baldi, M., Bodrato, M., Chiaraluce, F.: A new analysis of the McEliece cryptosystem based on QC-LDPC codes. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 246\u2013262. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85855-3_17"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Baldi, M., Cancellieri, G., Chiaraluce, F., Persichetti, E., Santini, P.: Using non-binary LDPC and MDPC codes in the McEliece cryptosystem. In: 2019 AEIT International Annual Conference (AEIT), pp. 1\u20136. IEEE (2019)","DOI":"10.23919\/AEIT.2019.8893339"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes. In: 2007 IEEE International Symposium on Information Theory, pp. 2591\u20132595. IEEE (2007)","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F., Garello, R., Mininni, F.: Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem. In: 2007 IEEE International Conference on Communications, pp. 951\u2013956. IEEE (2007)","DOI":"10.1109\/ICC.2007.161"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"TP Berger","year":"2009","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 77\u201397. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02384-2_6"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theory 24, 384\u2013386 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055873","DOI":"10.1109\/TIT.1978.1055873"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1038\/nature23461","volume":"549","author":"DJ Bernstein","year":"2017","unstructured":"Bernstein, D.J., Lange, T.: Post-quantum cryptography. Nature 549, 188\u2013194 (2017). https:\/\/doi.org\/10.1038\/nature23461","journal-title":"Nature"},{"issue":"5","key":"3_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1515\/dma-2014-0024","volume":"24","author":"MA Borodin","year":"2014","unstructured":"Borodin, M.A., Chizhov, I.V.: Effective attack on the McEliece cryptosystem based on reed-muller codes. Discret. Math. Appl. 24(5), 273\u2013280 (2014)","journal-title":"Discret. Math. Appl."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-25510-7_8","volume-title":"Post-Quantum Cryptography","author":"A Couvreur","year":"2019","unstructured":"Couvreur, A., Lequesne, M., Tillich, J.-P.: Recovering short secret keys of RLCE in polynomial time. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 133\u2013152. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_8"},{"key":"3_CR17","series-title":"CIM Series in Mathematical Sciences","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-17296-5_13","volume-title":"Coding Theory and Applications","author":"A Couvreur","year":"2015","unstructured":"Couvreur, A., M\u00e1rquez-Corbella, I., Pellikaan, R.: Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes. In: Pinto, R., Malonek, P.R., Vettori, P. (eds.) Coding Theory and Applications. CSMS, vol. 3, pp. 133\u2013140. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17296-5_13"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-662-46447-2_8","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"A Couvreur","year":"2015","unstructured":"Couvreur, A., Otmani, A., Tillich, J.-P., Gauthier\u2013Uma\u00f1a, V.: A polynomial-time attack on the BBCRS scheme. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 175\u2013193. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_8"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-54074-6_2","volume-title":"Code-Based Cryptography","author":"VM Deundyak","year":"2020","unstructured":"Deundyak, V.M., Kosolapov, Y.V., Maystrenko, I.A.: On the decipherment of Sidel\u2019nikov-type cryptosystems. In: Baldi, M., Persichetti, E., Santini, P. (eds.) CBCrypto 2020. LNCS, vol. 12087, pp. 20\u201340. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54074-6_2"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J-C Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 279\u2013298. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_14"},{"issue":"5","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1109\/18.412683","volume":"41","author":"MP Fossorier","year":"1995","unstructured":"Fossorier, M.P., Lin, S.: Soft-decision decoding of linear block codes based on ordered statistics. IEEE Trans. Inf. Theory 41(5), 1379\u20131396 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"EM Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 482\u2013489. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_41"},{"key":"3_CR23","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 (2005)"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R Gallager","year":"1962","unstructured":"Gallager, R.: Low-density parity-check codes. IRE Trans. Inf. Theory 8(1), 21\u201328 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-55589-8_7","volume-title":"Codes, Cryptology and Information Security","author":"CT Gueye","year":"2017","unstructured":"Gueye, C.T., Klamti, J.B., Hirose, S.: Generalization of BJMM-ISD using may-Ozerov nearest neighbor algorithm over an arbitrary finite field $$\\mathbb{F}_q$$. In: El Hajji, S., Nitaj, A., Souidi, E.M. (eds.) C2SI 2017. LNCS, vol. 10194, pp. 96\u2013109. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55589-8_7"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1109\/TIT.2018.2877458","volume":"65","author":"Q Guo","year":"2019","unstructured":"Guo, Q., Johansson, T., Wagner, P.S.: A key recovery reaction attack on QC-MDPC. IEEE Trans. Inf. Theory 65, 1845\u20131861 (2019). https:\/\/doi.org\/10.1109\/TIT.2018.2877458","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR27","unstructured":"Interlando, C., Khathuria, K., Rohrer, N., Rosenthal, J., Weger, V.: Generalization of the ball-collision algorithm. arXiv preprint: arXiv:1812.10955 (2018)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Ivanov, F., Krouk, E., Zyablov, V.: New code-based cryptosystem based on binary image of generalized reed-Solomon code. In: 2021 XVII International Symposium \u201cProblems of Redundancy in Information and Control Systems\u201d(REDUNDANCY), pp. 66\u201369. IEEE (2021)","DOI":"10.1109\/REDUNDANCY52534.2021.9606467"},{"issue":"3","key":"3_CR29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"H Janwa","year":"1996","unstructured":"Janwa, H., Moreno, O.: McEliece public key cryptosystems using algebraic-geometric codes. Des. Codes Crypt. 8(3), 293\u2013307 (1996)","journal-title":"Des. Codes Crypt."},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Kosolapov, Y., Lelyuk, A.: Cryptanalysis of the BBCRS system on reed-muller binary codes. Bull. South Ural State Univ. Ser. Math. Modell. Program. Comput. Softw. 14, 18\u201332 (2021). https:\/\/doi.org\/10.14529\/mmp210302","DOI":"10.14529\/mmp210302"},{"key":"3_CR31","first-page":"114","volume":"42","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: Public-key cryptosystem based on algebraic coding theory. PL Deep Space Netw. Prog. Report 42, 114\u2013116 (1978)","journal-title":"PL Deep Space Netw. Prog. Report"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-72540-4_20","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"L Minder","year":"2007","unstructured":"Minder, L., Shokrollahi, A.: Cryptanalysis of the Sidelnikov cryptosystem. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 347\u2013360. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_20"},{"key":"3_CR33","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, pp. 2069\u20132073. IEEE (2013). https:\/\/doi.org\/10.1109\/ISIT.2013.6620590","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Monico, C., Rosenthal, J., Shokrollahi, A.: Using low density parity check codes in the McEliece cryptosystem, pp. 215. IEEE (2000). https:\/\/doi.org\/10.1109\/ISIT.2000.866513","DOI":"10.1109\/ISIT.2000.866513"},{"key":"3_CR35","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Control Inf. Theory 15, 159\u2013166 (1986)","journal-title":"Prob. Control Inf. Theory"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11786-009-0015-8","volume":"3","author":"A Otmani","year":"2010","unstructured":"Otmani, A., Tillich, J.P., Dallot, L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. Math. Comput. Sci. 3, 129\u2013140 (2010). https:\/\/doi.org\/10.1007\/s11786-009-0015-8","journal-title":"Math. Comput. Sci."},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11780656_24","volume-title":"Information Security and Privacy","author":"R Overbeck","year":"2006","unstructured":"Overbeck, R.: Statistical decoding revisited. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol. 4058, pp. 283\u2013294. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780656_24"},{"issue":"2","key":"3_CR38","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2008","unstructured":"Overbeck, R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2008)","journal-title":"J. Cryptol."},{"key":"3_CR39","doi-asserted-by":"publisher","first-page":"4648","DOI":"10.1109\/TCOMM.2020.2987898","volume":"68","author":"P Santini","year":"2020","unstructured":"Santini, P., Battaglioni, M., Baldi, M., Chiaraluce, F.: Analysis of the error correction capability of LDPC and MDPC codes under parallel bit-flipping decoding and application to cryptography. IEEE Trans. Commun. 68, 4648\u20134660 (2020). https:\/\/doi.org\/10.1109\/TCOMM.2020.2987898","journal-title":"IEEE Trans. Commun."},{"key":"3_CR40","unstructured":"Sendrier, N.: On the structure of randomly permuted concatenated code. Ph.D. thesis, INRIA (1995)"},{"key":"3_CR41","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":"3_CR42","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"3","key":"3_CR43","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","volume":"4","author":"VM Sidelnikov","year":"1994","unstructured":"Sidelnikov, V.M.: A public-key cryptosystem based on binary reed-muller codes. Discret. Math. Appl. 4(3), 191\u2013208 (1994)","journal-title":"Discret. Math. Appl."},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On insecurity of cryptosystems based on generalized reed-solomon codes. Discrete Math. Appl. 2 (1992)","DOI":"10.1515\/dma.1992.2.4.439"},{"key":"3_CR45","doi-asserted-by":"publisher","unstructured":"Tillich, J.P.: The decoding failure probability of MDPC codes, pp. 941\u2013945. IEEE (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437843","DOI":"10.1109\/ISIT.2018.8437843"},{"key":"3_CR46","unstructured":"Vasseur, V.: Post-quantum cryptography: a study of the decoding of QC-MDPC codes. Ph.D. thesis, Universit\u00e9 de Paris (2021)"},{"key":"3_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-031-29689-5_8","volume-title":"Code-Based Cryptography","author":"K Vedenev","year":"2023","unstructured":"Vedenev, K., Kosolapov, Y.: Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem. In: Deneuville, J.C. (ed.) Code-Based Cryptography. Lecture Notes in Computer Science, vol. 13839, pp. 137\u2013153. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-29689-5_8"},{"key":"3_CR48","doi-asserted-by":"crossref","unstructured":"Wang, Y.: Quantum resistant random linear code based public key encryption scheme RLCE. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 2519\u20132523. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541753"},{"key":"3_CR49","unstructured":"Weger, V.: Information set decoding in the lee metric and the local to global principle for densities. Ph.D. thesis, PhD thesis, University of Zurich (2020)"},{"key":"3_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-12929-2_5","volume-title":"Post-Quantum Cryptography","author":"C Wieschebrink","year":"2010","unstructured":"Wieschebrink, C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 61\u201372. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_5"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T22:29:03Z","timestamp":1730413743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46495-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031464942","9783031464959"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46495-9_3","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)"}}]}}