{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T13:10:07Z","timestamp":1748092207509,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031902284","type":"print"},{"value":"9783031902291","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-90229-1_5","type":"book-chapter","created":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T12:47:52Z","timestamp":1748090872000},"page":"94-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Increasing Index Sizes for\u00a0Information Set Decoding Algorithms"],"prefix":"10.1007","author":[{"given":"Zachary","family":"Welch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,25]]},"reference":[{"key":"5_CR1","unstructured":"McEliece, R. J.: A public-key cryptosystem based on algebraic coding theory. In: DSN Progress Report 42-44, pp. 114\u2013116 (1978)"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Berlekamp, E., McEliece, R. Van Tilborg, H.: On the inherent intractability of certain coding problems (Corresp.). In: IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 384\u2013386 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055873","DOI":"10.1109\/TIT.1978.1055873"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th annual symposium on foundations of computer science, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"5_CR4","unstructured":"NIST.: Submission Requirements and Evaluation Criteria for the Post-Quantum Cryptography Standardization Process (2016). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf, last accessed 2024\/10\/24"},{"key":"5_CR5","unstructured":"Augot, D., Batina, L., Bernstein, D. J., Bos, J., Buchmann, J., Castryck, W., Dunkelman, O., G\u00fcneysu, T., Gueron, S., H\u00fclsing, A., Lange, T., Mohamed, M. S. E., Rechberger, C., Schwabe, P., Sendrier, N., Vercauteren, F., and Yang, B. Y.: Initial recommendations of long-term secure post-quantum systems. http:\/\/pqcrypto.eu.org\/docs\/initial-recommendations.pdf, last accessed 2024\/08\/28 (2015)"},{"key":"5_CR6","unstructured":"Albrecht, M. R., Bernstein, D. J., Chou, T., Cid, C., Gilcher, J., Lange, T., Maram, V., Von Maurich, I., Misoczki, R., Niederhagen, R., others: Classic McEliece: conservative code-based cryptography (2022)"},{"key":"5_CR7","unstructured":"Aragon, N., Barreto, P., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J. C., Gaborit, P., Ghosh, S., Gueron, S., G\u00fcneysu, T., others.: BIKE: bit flipping key encapsulation (2022)"},{"key":"5_CR8","unstructured":"Melchor, C. A., Aragon, N., Bettaieb, S., Bidoux, L., and Blazy, O., Deneuville, J.C., Dion, A., Gaborit, P., Lacan, J., Persichetti, E., Robert, J.M., V\u00e9ron, P., Z\u00e9mor, G.: Hamming quasi-cyclic (HQC) (2024)"},{"key":"5_CR9","unstructured":"Jao, D., Azarderakhsh, R., Campagna M., Costello C., De Feo, L., Hess B., Hutchinson, A., Jalali A., Karabina, K., Koziel B., LaMacchia B., Longa P., Naehrig M., Pereira, G., Renes J., Urbanik D.: Supersingular isogeny key encapsulation (2019)"},{"key":"5_CR10","unstructured":"Jao, D., Azarderakhsh, R., Campagna M., Costello C., De Feo, L., Hess B., Hutchinson, A., Jalali A., Karabina, K., Koziel B., LaMacchia B., Longa P., Naehrig M., Pereira, G., Renes J., Urbanik D.: SIKE and SIDH are insecure and should not be used (2022)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Prange, E. The use of information sets in decoding cyclic codes. In: IRE Transactions on Information Theory, 8(5):5-9 (1962)","DOI":"10.1109\/TIT.1962.1057777"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Coding Theory and Applications: 3rd International Colloquium Toulon, France, November 2-4, 1988 Proceedings 3, pp. 106\u2013113 (1988)","DOI":"10.1007\/BFb0019850"},{"key":"5_CR13","unstructured":"Dumer, I. I.: Two decoding algorithms for linear codes. In: Problemy Peredachi Informatsii, 25(1), 24-32 (1989)"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. In: IEEE Transactions on Information Theory, vol. 44, no. 1, pp. 367\u2013378 (1998). https:\/\/doi.org\/10.1109\/18.651067","DOI":"10.1109\/18.651067"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and Defending the McEliece Cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 31\u201346. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88403-3_3"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security Bounds for the Design of Code-Based Cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88\u2013105. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_6"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in $$O(2^{0.054n})$$. In: International Conference on the Theory and Application of Cryptology and Information Security pp. 107\u2013124 (2011)","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"5_CR18","doi-asserted-by":"crossref","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: Advances in Cryptology\u2013EUROCRYPT 2012: 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings 31, pp. 520\u2013536 (2012)","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"5_CR19","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":"5_CR20","doi-asserted-by":"publisher","unstructured":"Both, L., May, A.: Decoding linear codes with high error rate and its impact for LPN security. In: International Conference on Post-Quantum Cryptography April 1, 2018 pp. 25\u201346. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_2","DOI":"10.1007\/978-3-319-79063-3_2"},{"key":"5_CR21","unstructured":"Guo, Q., Johansson, T., Nguyen, V.: A new sieving-style information-set decoding algorithm. In: Cryptology ePrint Archive, Paper 2023\/247 (2023). https:\/\/eprint.iacr.org\/2023\/247"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Kimura, N., Takayasu, A., Takagi, T.: Memory-Efficient Quantum Information Set Decoding Algorithm. In: Simpson, L., Rezazadeh Baee, M.A. (eds) Information Security and Privacy. ACISP 2023. Lecture Notes in Computer Science, vol 13915. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35486-1_20","DOI":"10.1007\/978-3-031-35486-1_20"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Carrier, K., Hatey, V., Tillich, JP.: Projective Space Stern Decoding and Application to SDitH. In: Andreoni, M. (eds) Applied Cryptography and Network Security Workshops. ACNS 2024. Lecture Notes in Computer Science, vol 14587 pp. 29\u201352. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-61489-7_3","DOI":"10.1007\/978-3-031-61489-7_3"},{"key":"5_CR24","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. EUROCRYPT 2022. Lecture Notes in Computer Science, vol 13277. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_16","DOI":"10.1007\/978-3-031-07082-2_16"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Bernstein, D., Lange, P., Peters, C. Smaller decoding exponents: ball-collision decoding. In: Advances in Cryptology\u2013CRYPTO 2011: 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings 31, pp. 743\u2013760. Springer Berlin Heidelberg (2011)","DOI":"10.1007\/978-3-642-22792-9_42"}],"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-90229-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T12:47:55Z","timestamp":1748090875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90229-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031902284","9783031902291"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90229-1_5","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":"25 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cb-crypto.org\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}