{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T12:49:48Z","timestamp":1763988588849,"version":"3.40.2"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865985","type":"print"},{"value":"9783031865992","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-86599-2_4","type":"book-chapter","created":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:57:02Z","timestamp":1742842622000},"page":"104-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Both-May Information Set Decoding Algorithm: Towards More Efficient Time-Memory Trade-Offs"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Furue","sequence":"first","affiliation":[]},{"given":"Yusuke","family":"Aikawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"4_CR1","unstructured":"Albrecht, M.R., et\u00a0al.: Classic McEliece: Conservative code-based cryptography. In: Submission to NIST Post-Quantum Cryptography Standardization Process (2022)"},{"key":"4_CR2","unstructured":"Aragon, N., et\u00a0al.: BIKE: Bit flipping key encapsulation. In: Submission to NIST Post-Quantum Cryptography Standardization Process (2022)"},{"key":"4_CR3","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"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., Tilborg, H.V.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Bhattacharyya, S.,\u00a0Sarkar, P.: Concrete time\/memory trade-offs in generalised Stern\u2019s ISD algorithm. In: INDOCRYPT 2023. LNCS, vol. 14459, pp. 307\u2013328. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-56232-7_15","DOI":"10.1007\/978-3-031-56232-7_15"},{"key":"4_CR6","unstructured":"Both, L.,\u00a0May, A.: Optimizing BJMM with nearest neighbors: full decoding in $$2^{2\/21n}$$ and McEliece security. In: WCC Workshop on Coding and Cryptography, p. 214 (2017)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-79063-3_2","volume-title":"Post-Quantum Cryptography","author":"L Both","year":"2018","unstructured":"Both, L., May, A.: Decoding linear codes with high error rate and its impact for LPN security. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 25\u201346. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_2"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Carrier, K.,\u00a0Debris-Alazard, T.,\u00a0Meyer-Hilfiger, C., Tillich, J.-P.: Statistical decoding 2.0: reducing decoding to LPN. In: ASIACRYPT 2022. LNCS, vol. 13794, pp. 477\u2013507. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_17","DOI":"10.1007\/978-3-031-22972-5_17"},{"key":"4_CR9","unstructured":"Dumer, I.: On minimum distance decoding of linear codes. In: Proceedings of 5th Joint Soviet-Swedish International Workshop Information Theory, pp. 50\u201352 (1991)"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Esser, A.: Revisiting nearest-neighbor-based information set decoding. In: IMACC 2023. LNCS, vol. 14421, pp. 34\u201354. Springer, Heidelberg (2023). DOI: https:\/\/doi.org\/10.1007\/978-3-031-47818-5_3","DOI":"10.1007\/978-3-031-47818-5_3"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Esser, A.,\u00a0Bellini, E.: Syndrome decoding estimator. In: PKC 2022. LNCS, vol. 13177, pp. 112\u2013141. Springer, Heidelberg (2022). DOI: https:\/\/doi.org\/10.1007\/978-3-030-97121-2_5","DOI":"10.1007\/978-3-030-97121-2_5"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Esser, A.,\u00a0May, A.,\u00a0Zweydinger, F.: McEliece needs a break - solving McEliece-1284 and Quasi-Cyclic-2918 with modern ISD. In: EUROCRYPT 2022. LNCS, 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":"4_CR13","doi-asserted-by":"crossref","unstructured":"Esser, A., Verbel, J.A.,\u00a0Zweydinger, F.,\u00a0Bellini, E.: SoK: cryptographicestimators - a software library for cryptographic hardness estimation. In: AsiaCCS, pp. 560\u2013574. ACM (2024)","DOI":"10.1145\/3634737.3645007"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Esser, A.,\u00a0Zweydinger, F.: New time-memory trade-offs for subset sum - improving ISD in theory and practice. In: EUROCRYPT 2023. LNCS, vol. 14008, pp. 360\u2013390. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-30589-4_13"},{"key":"4_CR15","unstructured":"Hamdaoui, Y.,\u00a0Sendrier, N.: A non asymptotic analysis of information set decoding. Cryptology ePrint Archive, Paper 2013\/162 (2013)"},{"key":"4_CR16","volume":"79","author":"Y Li","year":"2023","unstructured":"Li, Y., Wang, L.-P.: Security analysis of the Classic McEliece, HQC and BIKE schemes in low memory. J. Inf. Secur. Appl. 79, 103651 (2023)","journal-title":"J. Inf. Secur. Appl."},{"key":"4_CR17","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{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_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-46800-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A May","year":"2015","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 203\u2013228. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_9"},{"key":"4_CR19","unstructured":"Melchor, C.A., et\u00a0al.: HQC: Hamming quasi-cyclic key encapsulation. In: Submission to NIST Post-Quantum Cryptography Standardization Process (2022)"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Narisada, S.,\u00a0Uemura, S.,\u00a0Okada, H.,\u00a0Furue, H.,\u00a0Aikawa, Y.,\u00a0Fukushima, K.: Solving McEliece-1409 in one day\u2014cryptanalysis with the improved BJMM algorithm. In: ISC 2024. LNCS, vol. 15258, pp. 3\u201323. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-75764-8_1","DOI":"10.1007\/978-3-031-75764-8_1"},{"key":"4_CR21","unstructured":"NIST. Status report on the third round of the NIST post-quantum cryptography standardization process. NIST Internal Report 8413 (2022)"},{"issue":"5","key":"4_CR22","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_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J Stern","year":"1989","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0019850"}],"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-031-86599-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:57:06Z","timestamp":1742842626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86599-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865985","9783031865992"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86599-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"15 March 2025","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2025.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}