{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:16:39Z","timestamp":1761808599589,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031296888"},{"type":"electronic","value":"9783031296895"}],"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-29689-5_8","type":"book-chapter","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T16:04:08Z","timestamp":1680019448000},"page":"137-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cryptanalysis of\u00a0Ivanov\u2013Krouk\u2013Zyablov Cryptosystem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7893-655X","authenticated-orcid":false,"given":"Kirill","family":"Vedenev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1491-524X","authenticated-orcid":false,"given":"Yury","family":"Kosolapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"key":"8_CR1","unstructured":"Aragon, N., et al.: BIKE - Bit-Flipping Key Encapsulation. https:\/\/bikesuite.org"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"6233","DOI":"10.1109\/TIT.2022.3168439","volume":"68","author":"N Aragon","year":"2022","unstructured":"Aragon, N., Blazy, O., Deneuville, J.C., Gaborit, P., Z\u00e9mor, G.: Ouroboros: an efficient and provably secure KEM family. IEEE Trans. Inf. Theory 68, 6233\u20136244 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-014-9187-8","volume":"29","author":"M Baldi","year":"2014","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., Schipani, D.: Enhanced Public Key Security for the McEliece Cryptosystem. J. Cryptol. 29(1), 1\u201327 (2014). https:\/\/doi.org\/10.1007\/s00145-014-9187-8","journal-title":"J. Cryptol."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-18681-8_16","volume-title":"Codes, Cryptology, and Information Security","author":"TP Berger","year":"2015","unstructured":"Berger, T.P., El Amrani, N.: Codes over $$\\cal{L}(GF(2)^m,GF(2)^m)$$, MDS diffusion matrices and cryptographic applications. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E.M. (eds.) C2SI 2015. LNCS, vol. 9084, pp. 197\u2013214. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18681-8_16"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"4641","DOI":"10.1109\/TIT.2019.2909872","volume":"65","author":"TP Berger","year":"2019","unstructured":"Berger, T.P., Gueye, C.T., Klamti, J.B.: Generalized subspace subcodes with application in cryptology. IEEE Trans. Inf. Theory 65, 4641\u20134657 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2909872","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"TP Berger","year":"2005","unstructured":"Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Des. Codes Crypt. 35(1), 63\u201379 (2005). https:\/\/doi.org\/10.1007\/s10623-003-6151-2","journal-title":"Des. Codes Crypt."},{"key":"8_CR7","unstructured":"Bernstein, D.J., et al.: Classic McEliece: conservative code-based cryptography. NIST Submissions (2020)"},{"issue":"5","key":"8_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1515\/dma-2014-0024","volume":"24","author":"MA Borodin","year":"2014","unstructured":"Borodin, M.A., Chizhov, I.V.: Effective attack on the McEliece cryptosystem based on Reed-Muller codes. Discret. Math. Appl. 24(5), 273\u2013280 (2014)","journal-title":"Discret. Math. Appl."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1109\/TIT.2021.3120440","volume":"68","author":"A Couvreur","year":"2022","unstructured":"Couvreur, A., Lequesne, M.: On the security of subspace subcodes of Reed-Solomon codes for public key encryption. IEEE Trans. Inf. Theory 68, 632\u2013648 (2022). https:\/\/doi.org\/10.1109\/TIT.2021.3120440","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-25510-7_8","volume-title":"Post-Quantum Cryptography","author":"A Couvreur","year":"2019","unstructured":"Couvreur, A., Lequesne, M., Tillich, J.-P.: Recovering short secret keys of RLCE in polynomial time. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 133\u2013152. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_8"},{"key":"8_CR11","series-title":"CIM Series in Mathematical Sciences","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-17296-5_13","volume-title":"Coding Theory and Applications","author":"A Couvreur","year":"2015","unstructured":"Couvreur, A., M\u00e1rquez-Corbella, I., Pellikaan, R.: Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes. In: Pinto, R., Malonek, P.R., Vettori, P. (eds.) Coding Theory and Applications. CSMS, vol. 3, pp. 133\u2013140. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17296-5_13"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-662-46447-2_8","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"A Couvreur","year":"2015","unstructured":"Couvreur, A., Otmani, A., Tillich, J.-P., Gauthier\u2013Uma\u00f1a, V.: A Polynomial-Time Attack on the BBCRS Scheme. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 175\u2013193. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_8"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"EM Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 482\u2013489. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_41"},{"key":"8_CR14","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2010","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2010)"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Ivanov, F., Krouk, E., Zyablov, V.: New code-based cryptosystem based on binary image of generalized Reed-Solomon code. In: 2021 XVII International Symposium \u201cProblems of Redundancy in Information and Control Systems\u201d (REDUNDANCY), pp. 66\u201369. IEEE (2021). https:\/\/doi.org\/10.1109\/REDUNDANCY52534.2021.9606467","DOI":"10.1109\/REDUNDANCY52534.2021.9606467"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"H Janwa","year":"1996","unstructured":"Janwa, H., Moreno, O.: McEliece public key cryptosystems using algebraic-geometric codes. Des. Codes Crypt. 8(3), 293\u2013307 (1996). https:\/\/doi.org\/10.1023\/A:1027351723034","journal-title":"Des. Codes Crypt."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.3934\/amc.2020053","volume":"15","author":"K Khathuria","year":"2021","unstructured":"Khathuria, K., Rosenthal, J., Weger, V.: Encryption scheme based on expanded Reed-Solomon codes. Adv. Math. Commun. 15, 207\u2013218 (2021). https:\/\/doi.org\/10.3934\/amc.2020053","journal-title":"Adv. Math. Commun."},{"key":"8_CR18","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes, vol. 16. Elsevier, Amsterdam (1977)"},{"key":"8_CR19","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 4244, 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"key":"8_CR20","unstructured":"Melchor, C.A., et al.: Hamming Quasi-Cyclic (HQC). https:\/\/pqc-hqc.org"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-72540-4_20","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"L Minder","year":"2007","unstructured":"Minder, L., Shokrollahi, A.: Cryptanalysis of the sidelnikov cryptosystem. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 347\u2013360. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_20"},{"key":"8_CR22","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Contr. Inf. Theory 15, 159\u2013166 (1986)","journal-title":"Prob. Contr. Inf. Theory"},{"issue":"2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11786-009-0015-8","volume":"3","author":"A Otmani","year":"2010","unstructured":"Otmani, A., Tillich, J.P., Dallot, L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. Math. Comput. Sci. 3(2), 129\u2013140 (2010). https:\/\/doi.org\/10.1007\/s11786-009-0015-8","journal-title":"Math. Comput. Sci."},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2008","unstructured":"Overbeck, R.: Structural attacks for public key cryptosystems based on gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2008). https:\/\/doi.org\/10.1007\/s00145-007-9003-9","journal-title":"J. Cryptol."},{"key":"8_CR25","unstructured":"Sendrier, N.: On the structure of randomly permuted concatenated code. Ph.D. thesis, INRIA (1995)"},{"issue":"3","key":"8_CR26","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","volume":"4","author":"VM Sidelnikov","year":"1994","unstructured":"Sidelnikov, V.M.: A public-key cryptosystem based on binary Reed-Muller codes. Discret. Math. Appl. 4(3), 191\u2013208 (1994)","journal-title":"Discret. Math. Appl."},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1515\/dma.1992.2.4.439","volume":"2","author":"VM Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Math. Appl. 2, 439\u2013444 (1992)","journal-title":"Discrete Math. Appl."},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Wang, Y.: Quantum resistant random linear code based public key encryption scheme RLCE. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 2519\u20132523. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541753"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-12929-2_5","volume-title":"Post-Quantum Cryptography","author":"C Wieschebrink","year":"2010","unstructured":"Wieschebrink, C.: Cryptanalysis of the niederreiter public key scheme based on GRS subcodes. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 61\u201372. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_5"},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1134\/S0032946022020077","volume":"58","author":"VV Zyablov","year":"2022","unstructured":"Zyablov, V.V., Ivanov, F.I., Krouk, E.A., Sidorenko, V.R.: On new problems in asymmetric cryptography based on error-resistant coding. Probl. Inf. Transm. 58, 184\u2013201 (2022). https:\/\/doi.org\/10.1134\/S0032946022020077","journal-title":"Probl. Inf. Transm."}],"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-29689-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T16:05:33Z","timestamp":1680019533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29689-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031296888","9783031296895"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29689-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cb-crypto.org\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","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":"8","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","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":"3","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)"}}]}}