{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:21:36Z","timestamp":1766578896556,"version":"build-2065373602"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T00:00:00Z","timestamp":1753920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T00:00:00Z","timestamp":1753920000000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10623-025-01683-z","type":"journal-article","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:18Z","timestamp":1753979118000},"page":"4779-4798","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the security of two IKKR-type code-based cryptosystems"],"prefix":"10.1007","volume":"93","author":[{"given":"Kirill","family":"Vedenev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,31]]},"reference":[{"issue":"5","key":"1683_CR1","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2018.2804444","volume":"64","author":"C Aguilar-Melchor","year":"2018","unstructured":"Aguilar-Melchor C., Blazy O., Deneuville J.-C., Gaborit P., Z\u00e9mor G.: Efficient encryption from random quasi-cyclic codes. IEEE Trans. Inf. Theory 64(5), 3927\u20133943 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1683_CR2","doi-asserted-by":"crossref","unstructured":"Alekhnovich M.: More on average case vs approximation complexity. In: 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp. 298\u2013307 (2003).","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"1683_CR3","unstructured":"Aragon N., et al.: BIKE: Bit Flipping Key Encapsulation, Round 4 Submission. NIST (2024). https:\/\/bikesuite.org."},{"issue":"1","key":"1683_CR4","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."},{"issue":"4","key":"1683_CR5","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1049\/iet-ifs.2018.5207","volume":"13","author":"M Baldi","year":"2019","unstructured":"Baldi M., Chiaraluce F., Rosenthal J., Santini P., Schipani D.: Security of generalised Reed\u2013Solomon code-based cryptosystems. IET Inf. Secur. 13(4), 404\u2013410 (2019). https:\/\/doi.org\/10.1049\/iet-ifs.2018.5207.","journal-title":"IET Inf. Secur."},{"key":"1683_CR6","doi-asserted-by":"publisher","unstructured":"Berger T.P., Gueye C.T., Klamti J.B., Ruatta O.: Designing a Public Key Cryptosystem Based on Quasi-Cyclic Subspace Subcodes of Reed\u2013Solomon Codes, pp. 97\u2013113 (2019). https:\/\/doi.org\/10.1007\/978-3-030-36237-96.","DOI":"10.1007\/978-3-030-36237-96"},{"key":"1683_CR7","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":"1683_CR8","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 Cryptogr. 35(1), 63\u201379 (2005). https:\/\/doi.org\/10.1007\/s10623-003-6151-2.","journal-title":"Des. Codes Cryptogr."},{"key":"1683_CR9","doi-asserted-by":"publisher","unstructured":"Bolkema J., Gluesing-Luerssen H., Kelley C.A., Lauter K.E., Malmskog B., Rosenthal J.: Variations of the Mceliece cryptosystem. In: Algebraic Geometry for Coding Theory and Cryptography, pp. 129\u2013150 (2017). https:\/\/doi.org\/10.1007\/978-3-319-63931-4_5.","DOI":"10.1007\/978-3-319-63931-4_5"},{"issue":"5","key":"1683_CR10","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\u2013Muller codes. Discret. Math. Appl. 24(5), 273\u2013280 (2014). https:\/\/doi.org\/10.1515\/dma-2014-0024.","journal-title":"Discret. Math. Appl."},{"key":"1683_CR11","doi-asserted-by":"publisher","unstructured":"Couvreur A., Lequesne M., Tillich J.-P.: Recovering short secret keys of RLCE in polynomial time. In: International Conference on Post-Quantum Cryptography. Lecture Notes in Computer Science, vol. 11505, pp. 133\u2013152 (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_8. Springer.","DOI":"10.1007\/978-3-030-25510-7_8"},{"key":"1683_CR12","doi-asserted-by":"publisher","unstructured":"Couvreur A., Otmani A., Tillich J.-P., Gauthier\u2013Uma\u00f1a V.: A Polynomial-time attack on the BBCRS scheme. In: Katz, J. (ed.) Public-Key Cryptography\u2014PKC 2015. Lecture Notes in Computer Science, vol. 9020, pp. 175\u2013193. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_8.","DOI":"10.1007\/978-3-662-46447-2_8"},{"issue":"2","key":"1683_CR13","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"73","author":"A Couvreur","year":"2014","unstructured":"Couvreur A., Gaborit P., Gauthier-Uma\u00f1a V., Otmani A., Tillich J.-P.: Distinguisher-based attacks on public-key cryptosystems using Reed\u2013Solomon codes. Des. Codes Crypt. 73(2), 641\u2013666 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9967-z.","journal-title":"Des. Codes Crypt."},{"key":"1683_CR14","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\u2013Solomon 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":"1683_CR15","doi-asserted-by":"publisher","unstructured":"Deundyak V.M., Kosolapov Y.V., Maystrenko I.A.: On the decipherment of Sidel\u2019nikov-type cryptosystems. In: Code-Based Cryptography: 8th International Workshop, CBCrypto 2020, Zagreb, Croatia, May 9\u201310, 2020, Revised Selected Papers, pp. 20\u201340. Springer, Berlin (2020). https:\/\/doi.org\/10.1007\/978-3-030-54074-6_2.","DOI":"10.1007\/978-3-030-54074-6_2"},{"key":"1683_CR16","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":"1683_CR17","doi-asserted-by":"publisher","unstructured":"Ivanov F., Kabatiansky G., Krouk E., Rumenko N.: A new code-based cryptosystem. In: Baldi, M., Persichetti, E., Santini, P. (eds.) Code-Based Cryptography. CBCrypto 2020. Lecture Notes in Computer Science, vol. 12087, pp. 41\u201349 (2020). https:\/\/doi.org\/10.1007\/978-3-030-54074-6_3.","DOI":"10.1007\/978-3-030-54074-6_3"},{"key":"1683_CR18","doi-asserted-by":"publisher","unstructured":"Ivanov F., Krouk E., Zyablov V.: New code-based cryptosystem based on binary image of generalized Reed\u2013Solomon code. In: 2021 XVII International Symposium \"Problems of Redundancy in Information and Control Systems\" (REDUNDANCY), pp. 66\u201369 (2021). https:\/\/doi.org\/10.1109\/REDUNDANCY52534.2021.9606467.","DOI":"10.1109\/REDUNDANCY52534.2021.9606467"},{"key":"1683_CR19","doi-asserted-by":"publisher","unstructured":"Kosolapov Y.V., Lelyuk A.A.: Cryptanalysis of the BBCRS system on reed-muller binary codes. Bulletin of the South Ural State University. Series \u201cMathematical Modelling, Programming and Computer Software 14(3), 18\u201332 (2021). https:\/\/doi.org\/10.14529\/mmp210302.","DOI":"10.14529\/mmp210302"},{"key":"1683_CR20","doi-asserted-by":"publisher","unstructured":"Krouk E., Kabatiansky G., Tavernier C.: McEliece-type cryptosystem based on correction of errors and erasures. In: 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY) (2023). https:\/\/doi.org\/10.1109\/redundancy59964.2023.10330197.","DOI":"10.1109\/redundancy59964.2023.10330197"},{"key":"1683_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2023.103530","volume":"76","author":"TSC Lau","year":"2023","unstructured":"Lau T.S.C., Ivanov F., Ariffin M.R.K., Chin J.-J., Yap T.T.V.: New code-based cryptosystems via the IKKR framework. J. Inform. Secur. Appl. 76, 103530 (2023). https:\/\/doi.org\/10.1016\/j.jisa.2023.103530.","journal-title":"J. Inform. Secur. Appl."},{"issue":"2","key":"1683_CR22","doi-asserted-by":"publisher","first-page":"353","DOI":"10.3934\/amc.2020132","volume":"17","author":"TSC Lau","year":"2023","unstructured":"Lau T.S.C., Tan C.H.: Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems. Adv. Math. Commun. 17(2), 353\u2013366 (2023). https:\/\/doi.org\/10.3934\/amc.2020132.","journal-title":"Adv. Math. Commun."},{"issue":"12","key":"1683_CR23","doi-asserted-by":"publisher","first-page":"2678","DOI":"10.1109\/lcomm.2020.3019054","volume":"24","author":"Y Lee","year":"2020","unstructured":"Lee Y., Cho J., Kim Y.-S., No J.-S.: Cryptanalysis of the Ivanov\u2013Kabatiansky\u2013Krouk\u2013Rumenko cryptosystems. IEEE Commun. Lett. 24(12), 2678\u20132681 (2020). https:\/\/doi.org\/10.1109\/lcomm.2020.3019054.","journal-title":"IEEE Commun. Lett."},{"key":"1683_CR24","volume-title":"The Theory of Error-correcting Codes. Mathematical Library","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-correcting Codes. Mathematical Library. North-Holland Publishing Company, Amsterdam (1977)."},{"key":"1683_CR25","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. Coding. Thv. 4244, 114\u2013116 (1978).","journal-title":"Coding. Thv."},{"key":"1683_CR26","unstructured":"Melchor C.A., Aragon N., Bettaieb S., Bidoux L., Blazy O., Bos J., Deneuville J.-C., Dion A., Gaborit P., Lacan J., Persichetti E., Robert J.-M., V\u00e9ron P., Z\u00e9mor G.: Hamming Quasi-Cyclic (HQC), Round 4 Submission. NIST (2024). https:\/\/pqc-hqc.org."},{"key":"1683_CR27","doi-asserted-by":"publisher","unstructured":"Minder L., Shokrollahi A.: Cryptanalysis of the Sidelnikov cryptosystem. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Lecture Notes in Computer Science, vol. 4515, pp. 347\u2013360 (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_20.","DOI":"10.1007\/978-3-540-72540-4_20"},{"key":"1683_CR28","doi-asserted-by":"publisher","unstructured":"Misoczki R., Tillich J.-P., Sendrier N., Barreto P.S.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: 2013 IEEE International Symposium on Information Theory, pp. 2069\u20132073 (2013). https:\/\/doi.org\/10.1109\/ISIT.2013.6620590.","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"1683_CR29","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inform. Theory 15, 159\u2013166 (1986).","journal-title":"Probl. Control Inform. Theory"},{"issue":"3","key":"1683_CR30","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). https:\/\/doi.org\/10.1515\/dma.1994.4.3.191.","journal-title":"Discret. Math. Appl."},{"key":"1683_CR31","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1992.2.4.439","author":"VM Sidelnikov","year":"1992","unstructured":"Sidelnikov V.M., Shestakov S.O.: On insecurity of cryptosystems based on generalized Reed\u2013Solomon codes. Discret. Math. Appl. (1992). https:\/\/doi.org\/10.1515\/dma.1992.2.4.439.","journal-title":"Discret. Math. Appl."},{"key":"1683_CR32","doi-asserted-by":"publisher","unstructured":"Vedenev K., Kosolapov Y.: Cryptanalysis of Ivanov\u2013Krouk\u2013Zyablov cryptosystem. In: Deneuville, J.-C. (ed.) Code-Based Cryptography. CBCrypto 2022. Lecture Notes in Computer Science, vol. 13839, pp. 137\u2013153 (2023). https:\/\/doi.org\/10.1007\/978-3-031-29689-5_8.","DOI":"10.1007\/978-3-031-29689-5_8"},{"key":"1683_CR33","doi-asserted-by":"publisher","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 (2016). https:\/\/doi.org\/10.1109\/ISIT.2016.7541753.","DOI":"10.1109\/ISIT.2016.7541753"},{"key":"1683_CR34","unstructured":"Weger V., Gassner N., Rosenthal J.: A Survey on Code-Based Cryptography (2024). arxiv:2201.07119."},{"key":"1683_CR35","doi-asserted-by":"publisher","unstructured":"Wieschebrink C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. In: International Workshop on Post-Quantum Cryptography. Lecture Notes in Computer Science, vol. 6061, pp. 61\u201372 (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_5.","DOI":"10.1007\/978-3-642-12929-2_5"},{"key":"1683_CR36","doi-asserted-by":"publisher","unstructured":"Wieschebrink C.: Two NP-complete problems in coding theory with an application in code based cryptography. In: 2006 IEEE International Symposium on Information Theory (2006). https:\/\/doi.org\/10.1109\/isit.2006.261651.","DOI":"10.1109\/isit.2006.261651"},{"key":"1683_CR37","unstructured":"Yackushenoks K., Ivanov F.: Cryptoanalysis McEliece-type cryptosystem based on correction of errors and erasures (2023). arxiv:2312.15912."},{"key":"1683_CR38","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":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01683-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01683-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01683-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T05:03:13Z","timestamp":1761800593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01683-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,31]]},"references-count":38,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["1683"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01683-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,7,31]]},"assertion":[{"value":"25 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}