{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:39:19Z","timestamp":1742935159490,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562310"},{"type":"electronic","value":"9783031562327"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-56232-7_15","type":"book-chapter","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:02:34Z","timestamp":1711634554000},"page":"307-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Concrete Time\/Memory Trade-Offs in\u00a0Generalised Stern\u2019s ISD Algorithm"],"prefix":"10.1007","author":[{"given":"Sreyosi","family":"Bhattacharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Palash","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"15_CR1","unstructured":"Aragon, N., et al.: BIKE, Round\u00a04 submission (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/post-quantum-cryptography\/documents\/round-4\/submissions\/BIKE-Round4.zip. Accessed 9 Aug 2023"},{"issue":"10","key":"15_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.3390\/a12100209","volume":"12","author":"M Baldi","year":"2019","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: A finite regime analysis of information set decoding algorithms. Algorithms 12(10), 209 (2019)","journal-title":"Algorithms"},{"key":"15_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology - 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, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31"},{"key":"15_CR4","unstructured":"Bernstein, D.J., Chou, T.: CryptAttackTester: formalizing attack analyses (2023). https:\/\/cat.cr.yp.to\/papers.html#cryptattacktester. Accessed 9 Aug 2023"},{"key":"15_CR5","unstructured":"Bernstein, D.J., et al.: Classic McEliece, Round\u00a04 submission (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/post-quantum-cryptography\/documents\/round-4\/submissions\/mceliece-Round4.tar.gz. Accessed 9 Aug 2023"},{"key":"15_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","volume-title":"PQCrypto 2008","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":"15_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology - CRYPTO 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 743\u2013760. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_42"},{"key":"15_CR8","series-title":"LNCS","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":"15_CR9","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":"15_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-030-97121-2_5","volume-title":"PKC 2022, Part I","author":"A Esser","year":"2022","unstructured":"Esser, A.: Syndrome decoding estimator. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022, Part I. LNCS, vol. 13177, pp. 112\u2013141. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_5"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-031-07082-2_16","volume-title":"Advances in Cryptology - EUROCRYPT 2022, Part III","author":"A Esser","year":"2022","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.) EUROCRYPT 2022, Part III, vol. 13277, pp. 433\u2013457. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_16"},{"key":"15_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-031-30589-4_13","volume-title":"Advances in Cryptology - EUROCRYPT 2023, Part V","author":"A Esser","year":"2023","unstructured":"Esser, A., Zweydinger, F.: New time-memory trade-offs for subset sum - improving ISD in theory and practice. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part V. LNCS, vol. 14008, pp. 360\u2013390. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_13"},{"key":"15_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology - 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":"15_CR14","unstructured":"Fleming, K.: ROUND 3 OFFICIAL COMMENT: Classic McEliece, started on November 10, 2020, 7:05:28 AM (2020). https:\/\/groups.google.com\/a\/list.nist.gov\/g\/pqc-forum\/c\/EiwxGnfQgec?pli=1. Accessed 9 Aug 2023"},{"key":"15_CR15","unstructured":"Knuth, D.E.: Art of Computer Programming, Volume 4A, The Combinatorial Algorithms, Part 1"},{"key":"15_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45961-8_25","volume-title":"Advances in Cryptology - EUROCRYPT 1988","author":"PJ Lee","year":"1988","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 275\u2013280. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_25"},{"issue":"5","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"JS Leon","year":"1988","unstructured":"Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inf. Theory 34(5), 1354\u20131359 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology - 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":"15_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-46800-5_9","volume-title":"Advances in Cryptology - EUROCRYPT 2015 Part I","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, Part I. LNCS, vol. 9056, pp. 203\u2013228. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_9"},{"key":"15_CR20","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Jet Propulsion Laboratory DSN Progress Report 42-44 (1978). http:\/\/ipnpr.jpl.nasa.gov\/progress report2\/42-44\/44N.PDF"},{"key":"15_CR21","unstructured":"Melchor, C.A., et al.: HQC, Round\u00a04 submission (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/post-quantum-cryptography\/documents\/round-4\/submissions\/HQC-Round4.zip. Accessed 9 Aug 2023"},{"key":"15_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"15_CR23","unstructured":"NIST. Call for proposals (2016). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf. Accessed 9 Aug 2023"},{"key":"15_CR24","unstructured":"NIST. Round\u00a04 submissions (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions. Accessed 9 Aug 2023"},{"issue":"5","key":"15_CR25","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":"15_CR26","unstructured":"Stein, W.A., et al.: Sage Mathematics Software (Version 8.1), The Sage Development Team (2017). http:\/\/www.sagemath.org. Accessed 9 Aug 2023"},{"key":"15_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J Stern","year":"1988","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G.D., Wolfmann, J. (eds.) Coding Theory and Applications. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0019850"},{"key":"15_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-29360-8_10","volume-title":"Post-Quantum Cryptography","author":"RC Torres","year":"2016","unstructured":"Torres, R.C., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 144\u2013161. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_10"},{"key":"15_CR29","unstructured":"Vasseur, V.: Information set decoding implementation (2019). https:\/\/github.com\/vvasseur\/isd\/blob\/master\/src\/dumer.c. Accessed 9 Aug 2023"},{"key":"15_CR30","unstructured":"Zweydinger, F.: Decoding (2022). https:\/\/github.com\/FloydZ\/decoding\/blob\/master\/src\/dumer.h. Accessed 9 Aug 2023"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56232-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:07:17Z","timestamp":1711634837000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56232-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562310","9783031562327"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56232-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Goa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2023","order":10,"name":"conference_id","label":"Conference ID","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","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":"27","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":"36% - 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":"4","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)"}}]}}