{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:02:03Z","timestamp":1786978923170,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385476","type":"print"},{"value":"9783031385483","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-38548-3_3","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:02:27Z","timestamp":1691521347000},"page":"70-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Exploring Decryption Failures of\u00a0BIKE: New Class of\u00a0Weak Keys and\u00a0Key Recovery Attacks"],"prefix":"10.1007","author":[{"given":"Tianrui","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoyun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"3_CR1","unstructured":"National institute of standards and technology: post-quantum cryptography project (2016). http:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography"},{"key":"3_CR2","doi-asserted-by":"crossref","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)","DOI":"10.6028\/NIST.IR.8413"},{"key":"3_CR3","unstructured":"Aragon, N., et al.: BIKE. Technical report, National Institute of Standards and Technology (2022). http:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"key":"3_CR4","unstructured":"Aragon, N., Gaborit, P.: A key recovery attack against LRPC using decryption failures. In: International Workshop on Coding and Cryptography, WCC, vol. 2019 (2019)"},{"key":"3_CR5","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 $$+$$ 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":"3_CR6","doi-asserted-by":"publisher","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theor. 24(3), 384\u2013386 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055873","DOI":"10.1109\/TIT.1978.1055873"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-030-44223-1_12","volume-title":"Post-Quantum Cryptography","author":"N Bindel","year":"2020","unstructured":"Bindel, N., Schanck, J.M.: Decryption failure is more likely after success. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 206\u2013225. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_12"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-45146-4_2","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J Bl\u00f6mer","year":"2003","unstructured":"Bl\u00f6mer, J., May, A.: New partial key exposure attacks on RSA. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 27\u201343. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_2"},{"key":"3_CR9","unstructured":"Chaulet, J.: \u00c9tude de cryptosyst\u00e8mes \u00e0 cl\u00e9 publique bas\u00e9s sur les codes MDPC quasi-cycliques. Ph.D. thesis, Paris 6 (2017)"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Chaulet, J., Sendrier, N.: Worst case QC-MDPC decoder for McEliece cryptosystem. In: IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 10\u201315 July 2016, pp. 1366\u20131370. IEEE (2016). https:\/\/doi.org\/10.1109\/ISIT.2016.7541522","DOI":"10.1109\/ISIT.2016.7541522"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-662-53140-2_14","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2016","author":"T Chou","year":"2016","unstructured":"Chou, T.: QcBits: constant-time small-key code-based cryptography. In: Gierlichs, B., Poschmann, A.Y. (eds.) CHES 2016. LNCS, vol. 9813, pp. 280\u2013300. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_14"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997). https:\/\/doi.org\/10.1007\/s001459900030","journal-title":"J. Cryptol."},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"D\u2019Anvers, J., Batsleer, S.: Multitarget decryption failure attacks and their application to saber and kyber. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) Proceedings of the 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2022, Virtual Event, Part I. LNCS, 8\u201311 March 2022, vol. 13177, pp. 3\u201333. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_1","DOI":"10.1007\/978-3-030-97121-2_1"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"D\u2019Anvers, J.P., Guo, Q., Johansson, T., Nilsson, A., Vercauteren, F., Verbauwhede, I.: Decryption failure attacks on IND-CCA secure lattice-based schemes. In: Lin, D., Sako, K. (eds.) 22nd International Conference on Theory and Practice of Public Key Cryptography, PKC 2019, Part II. LNCS, Beijing, China, 14\u201317 April 2019, vol. 11443, pp. 565\u2013598. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_19","DOI":"10.1007\/978-3-030-17259-6_19"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"D\u2019Anvers, J.P., Rossi, M., Virdia, F.: (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology, EUROCRYPT 2020, Part III. LNCS, Zagreb, Croatia, 10\u201314 May 2020, vol. 12107, pp. 3\u201333. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_1","DOI":"10.1007\/978-3-030-45727-3_1"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"D\u2019Anvers, J.P., Vercauteren, F., Verbauwhede, I.: The impact of error dependencies on ring\/mod-LWE\/LWR based schemes. In: Ding, J., Steinwandt, R. (eds.) 10th International Conference on Post-Quantum Cryptography, PQCrypto 2019, Chongqing, China, 8\u201310 May 2019, pp. 103\u2013115. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_6","DOI":"10.1007\/978-3-030-25510-7_6"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"den Boer, B., Bosselaers, A.: An attack on the last two rounds of MD4. In: Feigenbaum, J. (ed.) Advances in Cryptology, CRYPTO 1991. LNCS, Santa Barbara, CA, USA, 11\u201315 August 1992, vol. 576, pp. 194\u2013203. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_14","DOI":"10.1007\/3-540-46766-1_14"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Drucker, N., Gueron, S., Kostic, D.: On constant-time QC-MDPC decoding with negligible failure rate. Cryptology ePrint Archive (2019)","DOI":"10.1007\/978-3-030-54074-6_4"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Drucker, N., Gueron, S., Kostic, D.: QC-MDPC decoders with several shades of gray. In: Ding, J., Tillich, J.P. (eds.) 11th International Conference on Post-Quantum Cryptography, PQCrypto 2020, Paris, France, 15\u201317 April 2020, pp. 35\u201350. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_3","DOI":"10.1007\/978-3-030-44223-1_3"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Drucker, N., Gueron, S., Kostic, D., Persichetti, E.: On the applicability of the Fujisaki-Okamoto transformation to the BIKE KEM. Int. J. Comput. Math. Comput. Syst. Theor. 6(4), 364\u2013374 (2021). https:\/\/doi.org\/10.1080\/23799927.2021.1930176","DOI":"10.1080\/23799927.2021.1930176"},{"key":"3_CR21","unstructured":"Dumer, I.: On minimum distance decoding of linear codes. In: Proceedings of the 5th Joint Soviet-Swedish International Workshop on Information Theory, pp. 50\u201352 (1991)"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Esser, A., May, A., Verbel, J.A., Wen, W.: Partial key exposure attacks on bike, rainbow and NTRU. In: Dodis, Y., Shrimpton, T. (eds.) Proceedings of the 42nd Annual International Cryptology Conference Advances in Cryptology, CRYPTO 2022, Part III. LNCS, Santa Barbara, CA, USA, 15\u201318 August 2022, vol. 13509, pp. 346\u2013375. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_12","DOI":"10.1007\/978-3-031-15982-4_12"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Esser, A., May, A., Zweydinger, F.: McEliece needs a break - solving McEliece-1284 and quasi-cyclic-2918 with modern ISD. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology, EUROCRYPT 2022, Part III. LNCS, Trondheim, Norway, 30 May\u20133 June 2022, vol. 13277, pp. 433\u2013457. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_16","DOI":"10.1007\/978-3-031-07082-2_16"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Fabsic, T., Hromada, V., Stankovski, P., Zajac, P., Guo, Q., Johansson, T.: A reaction attack on the QC-LDPC McEliece cryptosystem. In: Lange, T., Takagi, T. (eds.) 8th International Workshop on Post-Quantum Cryptography, PQCrypto 2017, Utrecht, The Netherlands, 26\u201328 June 2017, pp. 51\u201368. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_4","DOI":"10.1007\/978-3-319-59879-6_4"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Fujisaki, E., Okamoto, T.: How to enhance the security of public-key encryption at minimum cost. In: Imai, H., Zheng, Y. (eds.) 2nd International Workshop on Theory and Practice in Public Key Cryptography, PKC\u201999. LNCS, Kamakura, Japan, 1\u20133 March 1999, vol. 1560, pp. 53\u201368. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49162-7_5","DOI":"10.1007\/3-540-49162-7_5"},{"issue":"1","key":"3_CR26","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. Theor. 8(1), 21\u201328 (1962)","journal-title":"IRE Trans. Inf. Theor."},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Gama, N., Nguyen, P.Q.: New chosen-ciphertext attacks on NTRU. In: Okamoto, T., Wang, X. (eds.) 10th International Conference on Theory and Practice of Public Key Cryptography, PKC 2007. LNCS, Beijing, China, 16\u201320 April 2007, vol. 4450, pp. 89\u2013106. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_7","DOI":"10.1007\/978-3-540-71677-8_7"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T.: A new decryption failure attack against HQC. In: Moriai, S., Wang, H. (eds.) Advances in Cryptology, ASIACRYPT 2020, Part I. LNCS, Daejeon, South Korea, 7\u201311 December 2020, vol. 12491, pp. 353\u2013382. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_12","DOI":"10.1007\/978-3-030-64837-4_12"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T., Stankovski, P.: A key recovery attack on MDPC with CCA security using decoding errors. In: Cheon, J.H., Takagi, T. (eds.) Advances in Cryptology, ASIACRYPT 2016, Part I. LNCS, Hanoi, Vietnam, 4\u20138 December 2016, vol. 10031, pp. 789\u2013815. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_29","DOI":"10.1007\/978-3-662-53887-6_29"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Henecka, W., May, A., Meurer, A.: Correcting errors in RSA private keys. In: Rabin, T. (ed.) Advances in Cryptology, CRYPTO 2010. LNCS, Santa Barbara, CA, USA, 15\u201319 August 2010, vol. 6223, pp. 351\u2013369. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_19","DOI":"10.1007\/978-3-642-14623-7_19"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Heyse, S., von Maurich, I., G\u00fcneysu, T.: Smaller keys for code-based cryptography: QC-MDPC McEliece implementations on embedded devices. In: Bertoni, G., Coron, J.S. (eds.) Cryptographic Hardware and Embedded Systems, CHES 2013. LNCS, Santa Barbara, CA, USA, 20\u201323 August 2013, vol. 8086, pp. 273\u2013292. Springer, Heidelberg (20123). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_16","DOI":"10.1007\/978-3-642-40349-1_16"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Kalai, Y., Reyzin, L. (eds.) 15th Theory of Cryptography Conference, TCC 2017, Part I. LNCS, Baltimore, MD, USA, 12\u201315 November 2017, vol. 10677, 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"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Horlemann, A.L., Puchinger, S., Renner, J., Schamberger, T., Wachter-Zeh, A.: Information-set decoding with hints. In: Wachter-Zeh, A., Bartz, H., Liva, G. (eds.) Code-Based Cryptography, CBCrypto 2021. LNCS, vol. 13150, pp. 60\u201383. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-98365-9_4","DOI":"10.1007\/978-3-030-98365-9_4"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Howgrave-Graham, N., et al.: The impact of decryption failures on the security of NTRU encryption. In: Boneh, D. (ed.) Advances in Cryptology, CRYPTO 2003. LNCS, Santa Barbara, CA, USA, 17\u201321 August 2003, vol. 2729, pp. 226\u2013246. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_14","DOI":"10.1007\/978-3-540-45146-4_14"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Jaulmes, \u00c9., Joux, A.: A chosen-ciphertext attack against NTRU. In: Bellare, M. (ed.) Advances in Cryptology, CRYPTO 2000. LNCS, vol. 1880, pp. 20\u201335, Santa Barbara, CA, USA, 20\u201324 August 2000. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/3-540-44598-6_2","DOI":"10.1007\/3-540-44598-6_2"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Kirshanova, E., May, A.: Decoding McEliece with a hint - secret Goppa key parts reveal everything. In: Galdi, C., Jarecki, S. (eds.) Proceedings of the 13th International Conference on Security and Cryptography for Networks, SCN 2022, Amalfi, Italy, 12\u201314 September 2022. LNCS, vol. 13409, pp. 3\u201320. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_1","DOI":"10.1007\/978-3-031-14791-3_1"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"von Maurich, I., G\u00fcneysu, T.: Towards side-channel resistant implementations of QC-MDPC McEliece encryption on constrained devices. In: Mosca, M. (ed.) 6th International Workshop on Post-Quantum Cryptography, PQCrypto 2014, Waterloo, Ontario, Canada, 1\u20133 October 2014, pp. 266\u2013282. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_16","DOI":"10.1007\/978-3-319-11659-4_16"},{"key":"3_CR38","doi-asserted-by":"publisher","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.) Advances in Cryptology, ASIACRYPT 2011. LNCS, Seoul, South Korea, 4\u20138 December 2011, vol. 7073, pp. 107\u2013124. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_6","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"3_CR39","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic Coding Theory, pp. 114\u2013116. The Deep Space Network Progress Report, DSN PR 42-44 (1978)"},{"key":"3_CR40","doi-asserted-by":"publisher","unstructured":"Misoczki, R., Tillich, J., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, 7\u201312 July 2013, pp. 2069\u20132073. IEEE (2013). https:\/\/doi.org\/10.1109\/ISIT.2013.6620590","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.P., Sendrier, N., Barreto, P.S.: MDPC-McEliece: New McEliece variants from moderate density parity-check codes. In: 2013 IEEE International Symposium on Information Theory, pp. 2069\u20132073. IEEE (2013)","DOI":"10.1109\/ISIT.2013.6620590"},{"issue":"2","key":"3_CR42","first-page":"157","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Contr. Inform. Theor. 15(2), 157\u2013166 (1986)","journal-title":"Prob. Contr. Inform. Theor."},{"key":"3_CR43","doi-asserted-by":"publisher","unstructured":"Sendrier, N.: Decoding one out of many. In: Yang, B.Y. (ed.) 4th International Workshop on Post-Quantum Cryptography, PQCrypto 2011, Tapei, Taiwan, 29 November\u20132 December 2011, pp. 51\u201367. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_4","DOI":"10.1007\/978-3-642-25405-5_4"},{"key":"3_CR44","doi-asserted-by":"publisher","unstructured":"Sendrier, N., Vasseur, V.: On the decoding failure rate of QC-MDPC bit-flipping decoders. In: Ding, J., Steinwandt, R. (eds.) 10th International Conference on Post-Quantum Cryptography, PQCrypto 2019, Chongqing, China, 8\u201310 May 2019, pp. 404\u2013416. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_22","DOI":"10.1007\/978-3-030-25510-7_22"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Sendrier, N., Vasseur, V.: On the existence of weak keys for QC-MDPC decoding. Cryptology ePrint Archive (2020)","DOI":"10.1007\/978-3-030-44223-1_2"},{"key":"3_CR46","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, 20\u201322 November 1994, pp. 124\u2013134. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"3_CR47","doi-asserted-by":"publisher","unstructured":"Tillich, J.: The decoding failure probability of MDPC codes. In: 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, 17\u201322 June 2018, pp. 941\u2013945. IEEE (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437843","DOI":"10.1109\/ISIT.2018.8437843"},{"key":"3_CR48","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_CR49","unstructured":"Vasseur, V.: QC-MDPC codes DFR and the IND-CCA security of bike. HAL (2022)"},{"key":"3_CR50","doi-asserted-by":"publisher","unstructured":"Zhou, Y., van de Pol, J., Yu, Y., Standaert, F.X.: A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding. In: Proceedings of the 28th International Conference on the Theory and Application of Cryptology and Information Security, Advances in Cryptology (ASIACRYPT 2022, Part IV), Taipei, Taiwan, 5\u20139 December 2022, pp. 508\u2013536. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_18","DOI":"10.1007\/978-3-031-22972-5_18"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38548-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:02:25Z","timestamp":1753567345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38548-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385476","9783031385483"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38548-3_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":"9 August 2023","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","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":"124","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":"26% - 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":"15","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)"}}]}}