{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:04Z","timestamp":1742914024094,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031172335"},{"type":"electronic","value":"9783031172342"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17234-2_4","type":"book-chapter","created":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T21:02:18Z","timestamp":1664139738000},"page":"69-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Interleaved Prange: A New Generic Decoder for\u00a0Interleaved Codes"],"prefix":"10.1007","author":[{"given":"Anmoal","family":"Porwal","sequence":"first","affiliation":[]},{"given":"Lukas","family":"Holzbaur","sequence":"additional","affiliation":[]},{"given":"Hedongliang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Renner","sequence":"additional","affiliation":[]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[]},{"given":"Violetta","family":"Weger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"key":"4_CR1","unstructured":"Melchor, C.A., et al.: ROLLO- Rank-Ouroboros, LAKE & LOCKER. NIST PQC Call for Proposals (2020). Round 2 Submission"},{"key":"4_CR2","unstructured":"Melchor, C.A., et al.: Rank Quasi-Cyclic (RQC). NIST PQC Call for Proposals (2020). Round 2 Submission"},{"key":"4_CR3","unstructured":"Albrecht, M.R., et al.: Classic McEliece: Conservative Code-Based Cryptography. NIST PQC Call for Proposals (2020). Round 3 Submission"},{"issue":"3","key":"4_CR4","first-page":"23","volume":"30","author":"A Barg","year":"1994","unstructured":"Barg, A.: Some new NP-complete coding problems. Problemy Peredachi Informatsii 30(3), 23\u201328 (1994)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"3","key":"4_CR5","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., Van Tilborg, H.: 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_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-030-81293-5_3","volume-title":"Post-Quantum Cryptography","author":"A Chailloux","year":"2021","unstructured":"Chailloux, A., Debris-Alazard, T., Etinski, S.: Classical and quantum algorithms for\u00a0generic syndrome decoding problems and applications to the Lee metric. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 44\u201362. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_3"},{"key":"4_CR7","unstructured":"Chen, L., et al.: Report on post-quantum cryptography, vol. 12. US Department of Commerce, National Institute of Standards and Technology (2016)"},{"key":"4_CR8","unstructured":"Elleuch, M., Wachter-Zeh, A., Zeh, A.: A public-key cryptosystem from interleaved Goppa codes. arXiv preprint arXiv:1809.03024 (2018)"},{"issue":"7","key":"4_CR9","doi-asserted-by":"publisher","first-page":"2339","DOI":"10.1109\/18.796374","volume":"45","author":"C Haslach","year":"1999","unstructured":"Haslach, C., Han Vinck, A.J.: A decoding algorithm with restrictions for array codes. IEEE Trans. Inf. Theory 45(7), 2339\u20132344 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Haslach, C., Han Vinck, A.J.: Efficient decoding of interleaved linear block codes. In: 2000 IEEE International Symposium on Information Theory (Cat. No. 00CH37060), p. 149. IEEE (2000)","DOI":"10.1109\/ISIT.2000.866441"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Holzbaur, L., Liu, H., Puchinger, S., Wachter-Zeh, A.: On decoding and applications of interleaved Goppa codes. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 1887\u20131891. IEEE (2019)","DOI":"10.1109\/ISIT.2019.8849600"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Horlemann-Trautmann, A.-L., Weger, V.: Information set decoding in the Lee metric with applications to cryptography. Adv. Math. Commun. 15(4) (2021)","DOI":"10.3934\/amc.2020089"},{"issue":"10","key":"4_CR13","doi-asserted-by":"publisher","first-page":"2669","DOI":"10.1109\/TIT.2002.802608","volume":"48","author":"T Johansson","year":"2002","unstructured":"Johansson, T., Jonsson, F.: On the complexity of some cryptographic problems based on the general decoding problem. IEEE Trans. Inf. Theory 48(10), 2669\u20132678 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BFb0024461","volume-title":"Crytography and Coding","author":"G Kabatianskii","year":"1997","unstructured":"Kabatianskii, G., Krouk, E., Smeets, B.: A digital signature scheme based on random error-correcting codes. In: Darnell, M. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 161\u2013167. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0024461"},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/0470867574","volume-title":"Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept","author":"G Kabatiansky","year":"2005","unstructured":"Kabatiansky, G., Krouk, E., Semenov, S.: Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept. Wiley, Hoboken (2005)"},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/18.53757","volume":"36","author":"JJ Metzner","year":"1990","unstructured":"Metzner, J.J., Kapturowski, E.J.: A general decoding technique applicable to replicated file disagreement location and concatenated code decoding. IEEE Trans. Inf. Theory 36(4), 911\u2013917 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR17","unstructured":"Moody, D.: The beginning of the end: the first NIST PQC standards (2022). https:\/\/csrc.nist.gov\/Presentations\/2022\/the-beginning-of-the-end-the-first-nist-pqc-standa"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-25405-5_7","volume-title":"Post-Quantum Cryptography","author":"A Otmani","year":"2011","unstructured":"Otmani, A., Tillich, J.-P.: An efficient attack on all concrete KKS proposals. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 98\u2013116. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_7"},{"issue":"5","key":"4_CR19","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_CR20","doi-asserted-by":"crossref","unstructured":"Renner, J., Puchinger, S., Wachter-Zeh, A.: Interleaving Loidreau\u2019s rank-metric cryptosystem. In: 2019 XVI International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY), pp. 127\u2013132. IEEE (2019)","DOI":"10.1109\/REDUNDANCY48165.2019.9003318"},{"issue":"5","key":"4_CR21","doi-asserted-by":"publisher","first-page":"2697","DOI":"10.1109\/TIT.2014.2310479","volume":"60","author":"RM Roth","year":"2014","unstructured":"Roth, R.M., Vontobel, P.O.: Coding for combined block-symbol error correction. IEEE Trans. Inf. Theory 60(5), 2697\u20132713 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR22","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":"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"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Weger, V., Khathuria, K., Horlemann, A.-L., Battaglioni, M., Santini, P., Persichetti, E.: On the hardness of the Lee syndrome decoding problem. Adv. Math. Commun. (2022)","DOI":"10.3934\/amc.2022029"}],"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-17234-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T16:05:00Z","timestamp":1728057900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17234-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031172335","9783031172342"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17234-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 September 2022","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.pqcrypto.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":"66","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":"23","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.1","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":"5","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)"}}]}}