{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T11:59:46Z","timestamp":1793102386647,"version":"4.5.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"French Agence Nationale de la Recherche","award":["ANR-17-CE39-0007"],"award-info":[{"award-number":["ANR-17-CE39-0007"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10623-023-01265-x","type":"journal-article","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T17:01:46Z","timestamp":1689786106000},"page":"3671-3707","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Revisiting algebraic attacks on MinRank and on the rank decoding problem"],"prefix":"10.1007","volume":"91","author":[{"given":"Magali","family":"Bardet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0191-3181","authenticated-orcid":false,"given":"Pierre","family":"Briaud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maxime","family":"Bros","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,19]]},"reference":[{"key":"1265_CR1","unstructured":"Aguilar Melchor C., Aragon N., Bettaieb S., Bidoux L., Blazy O., Deneuville J.C., Gaborit P., Hauteville A., Z\u00e9mor G.: Ouroboros-R. First round submission to the NIST post-quantum cryptography call (2017). https:\/\/pqc-ouroborosr.org."},{"key":"1265_CR2","unstructured":"Aguilar Melchor C., Aragon N., Bettaieb S., Bidoux L., Blazy O., Deneuville J.C., Gaborit P., Z\u00e9mor G.: Rank quasi cyclic (RQC). First round submission to the NIST post-quantum cryptography call (2017). https:\/\/pqc-rqc.org."},{"key":"1265_CR3","unstructured":"Aguilar Melchor C., Aragon N., Bettaieb S., Bidoux L., Blazy O., Deneuville J.C., Gaborit P., Z\u00e9mor G., Couvreur A., Hauteville A.: Rank quasi cyclic (RQC). Second round submission to the NIST post-quantum cryptography call (2019). https:\/\/pqc-rqc.org."},{"key":"1265_CR4","unstructured":"Aguilar Melchor C., Aragon N., Bettaieb S., Bidoux L., Blazy O., Bros M., Couvreur A., Deneuville J.C., Gaborit P., Z\u00e9mor G., Hauteville A.: Rank quasi cyclic (RQC). Second Round submission to NIST Post-Quantum Cryptography call (2020). https:\/\/pqc-rqc.org."},{"key":"1265_CR5","doi-asserted-by":"crossref","unstructured":"Aguilar Melchor C., Aragon N., Dyseryn V., Gaborit P., Z\u00e9mor G.: LRPC codes with multiple syndromes: near ideal-size KEMs without ideals (2022). arXiv:2206.11961.","DOI":"10.1007\/978-3-031-17234-2_3"},{"key":"1265_CR6","doi-asserted-by":"publisher","unstructured":"Alagic G., Jacob A., Apon D., Cooper D., Dang Q., Kelsey J., Liu Y.K., Miller C., Moody D., Peralta R., Perlner R., Robinson A., Smith-Tone D.: Status report on the second round of the NIST post-quantum cryptography standardization process. Tech. Rep. NISTIR 8309, NIST (2020). https:\/\/doi.org\/10.6028\/NIST.IR.8309, https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2020\/NIST.IR.8309.pdf.","DOI":"10.6028\/NIST.IR.8309"},{"key":"1265_CR7","unstructured":"Aragon N., Blazy O., Deneuville J.C., Gaborit P., Hauteville A., Ruatta O., Tillich J.P., Z\u00e9mor G.: LAKE \u2013 Low rAnk parity check codes Key Exchange. First round submission to the NIST post-quantum cryptography call (2017). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/submissions\/LAKE.zip."},{"key":"1265_CR8","unstructured":"Aragon N., Blazy O., Deneuville J.C., Gaborit P., Hauteville A., Ruatta O., Tillich J.P., Z\u00e9mor G.: LOCKER \u2013 LOw rank parity ChecK codes EncRyption. First round submission to the NIST post-quantum cryptography call (2017). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/submissions\/LOCKER.zip."},{"key":"1265_CR9","unstructured":"Aragon N., Gaborit P., Hauteville A., Ruatta O., Z\u00e9mor G.: Ranksign\u2014a signature proposal for the NIST\u2019s call. First round submission to the NIST post-quantum cryptography call (2017). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/submissions\/RankSign.zip."},{"key":"1265_CR10","doi-asserted-by":"crossref","unstructured":"Aragon N., Gaborit P., Hauteville A., Tillich J.P.: Improvement of Generic Attacks on the Rank Syndrome Decoding Problem. Working paper or preprint (2017). https:\/\/hal.archives-ouvertes.fr\/hal-01618464.","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"1265_CR11","doi-asserted-by":"publisher","unstructured":"Aragon N., Gaborit P., Hauteville A., Tillich J.P.: A new algorithm for solving the rank syndrome decoding problem. In: 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17\u201322, 2018. pp. 2421\u20132425. IEEE (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437464.","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"1265_CR12","unstructured":"Aragon N., Blazy O., Deneuville J.C., Gaborit P., Hauteville A., Ruatta O., Tillich J.P., Z\u00e9mor G., Aguilar Melchor C., Bettaieb S., Bidoux L., Bardet M., Otmani A.: ROLLO (merger of Rank-Ouroboros, LAKE and LOCKER). Second round submission to the NIST post-quantum cryptography call (2019). https:\/\/pqc-rollo.org."},{"key":"1265_CR13","doi-asserted-by":"publisher","unstructured":"Aragon N., Blazy O., Gaborit P., Hauteville A., Z\u00e9mor G.: Durandal: a rank metric based signature scheme. In: Advances in Cryptology\u2014EUROCRYPT 2019\u201438th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part III. LNCS, vol. 11478, pp. 728\u2013758. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_25.","DOI":"10.1007\/978-3-030-17659-4_25"},{"key":"1265_CR14","unstructured":"Baena J., Briaud P., Cabarcas D., Perlner R.A., Smith-Tone D., Verbel J.A.: Improving support-minors rank attacks: applications to GeMSS and Rainbow. IACR Cryptol. ePrint Arch., accepted for publication in CRYPTO 2022, p. 1677 (2021). https:\/\/eprint.iacr.org\/2021\/1677."},{"key":"1265_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-81293-5_23","volume-title":"Post-Quantum Cryptography","author":"M Bardet","year":"2021","unstructured":"Bardet M., Briaud P.: An algebraic approach to the rank support learning problem. In: Cheon J.H., Tillich J.P. (eds.) Post-Quantum Cryptography, vol. 12841, pp. 442\u2013462. LNCS. Springer, Cham (2021)."},{"key":"1265_CR16","doi-asserted-by":"crossref","unstructured":"Bardet M., Briaud P., Bros M., Gaborit P., Neiger V., Ruatta O., Tillich J.: An algebraic attack on rank metric code-based cryptosystems. In: Canteaut A., Ishai Y. (eds.) Advances in Cryptology\u2014EUROCRYPT 2020, pp. 64\u201393. Springer, Cham (2020) arXiv:1910.00810.","DOI":"10.1007\/978-3-030-45727-3_3"},{"key":"1265_CR17","doi-asserted-by":"publisher","unstructured":"Bardet M., Bros M., Cabarcas D., Gaborit P., Perlner R., Smith-Tone D., Tillich J.P., Verbel J.: Improvements of algebraic attacks for solving the rank decoding and minrank problems. In: Advances in Cryptology\u2014ASIACRYPT 2020, International Conference on the Theory and Application of Cryptology and Information Security, 2020. Proceedings. pp. 507\u2013536 (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_17.","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"1265_CR18","doi-asserted-by":"crossref","unstructured":"Bellini E., Caullery F., Gaborit P., Manzano M., Mateu V.: Improved Veron identification and signature schemes in the rank metric. In: Proc. IEEE Int. Symposium Inf. Theory\u2014ISIT\u00a02019, pp. 1872\u20131876. IEEE, Paris (2019). arXiv:1903.10212.","DOI":"10.1109\/ISIT.2019.8849585"},{"key":"1265_CR19","doi-asserted-by":"publisher","unstructured":"Bellini E., Gaborit P., Hasikos A., Mateu V.: Enhancing code based zero-knowledge proofs using rank metric. In: Krenn S., Shulman H., Vaudenay S. (eds.) Cryptology and Network Security\u201419th International Conference, CANS 2020, Vienna, Austria, 14\u201316 December 2020, Proceedings. Lecture Notes in Computer Science, vol. 12579, pp. 570\u2013592. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_28.","DOI":"10.1007\/978-3-030-65411-5_28"},{"key":"1265_CR20","doi-asserted-by":"crossref","unstructured":"Bellini E., Esser A., Sanna C., Verbel J.: MR-DSS\u2014smaller MinRank-based (ring-)signatures. In: Cheon\u00a0J.H. Johansson J.T. (eds.) Post-Quantum Cryptography\u00a02022. LNCS, vol. 13512. Springer, Berlin (2022). https:\/\/eprint.iacr.org\/2022\/973.","DOI":"10.1007\/978-3-031-17234-2_8"},{"key":"1265_CR21","unstructured":"Bellini E., Esser A., Sanna C., Verbel J.: MR-DSS\u2014smaller MinRank-based (ring-)signatures. IACR Cryptology ePrint Archive, version 20220921:142218. Report\u00a02022\/973 (2022). https:\/\/eprint.iacr.org\/2022\/973."},{"key":"1265_CR22","doi-asserted-by":"publisher","unstructured":"Beullens W.: Improved cryptanalysis of UOV and Rainbow. In: Canteaut A., Standaert F.X. (eds.) Advances in Cryptology\u2014EUROCRYPT 2021. Lecture Notes in Computer Science, vol. 12696, pp. 348\u2013373. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_13.","DOI":"10.1007\/978-3-030-77870-5_13"},{"key":"1265_CR23","doi-asserted-by":"crossref","unstructured":"Beullens W.: Breaking Rainbow takes a weekend on a laptop. In: Advances in Cryptology\u2014CRYPTO\u00a02022. LNCS, Springer, Berlin (2022). https:\/\/eprint.iacr.org\/2022\/214.","DOI":"10.1007\/978-3-031-15979-4_16"},{"key":"1265_CR24","unstructured":"Bidoux L., Briaud P., Bros M., Gaborit P.: RQC revisited and more cryptanalysis for rank-based cryptography (2022). arXiv:2207.01410."},{"key":"1265_CR25","doi-asserted-by":"crossref","unstructured":"Bruns W., Vetter U.: Determinantal Rings. LNCS, vol. 1327. Springer, Berlin (1988).","DOI":"10.1007\/BFb0080378"},{"issue":"3","key":"1265_CR26","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1006\/jcss.1998.1608","volume":"58","author":"JF Buss","year":"1999","unstructured":"Buss J.F., Frandsen G.S., Shallit J.O.: The computational complexity of some problems of linear algebra. J. Comput. Syst. Sci. 58(3), 572\u2013596 (1999).","journal-title":"J. Comput. Syst. Sci."},{"key":"1265_CR27","doi-asserted-by":"publisher","unstructured":"Cabarcas D., Smith-Tone D., Verbel J.: Key recovery attack for ZHFE. In: Post-Quantum Cryptography\u00a02017. LNCS, vol. 10346, pp. 289\u2013308. Utrecht, The Netherlands (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_17.","DOI":"10.1007\/978-3-319-59879-6_17"},{"key":"1265_CR28","doi-asserted-by":"crossref","unstructured":"Chabaud F., Stern J.: The cryptographic security of the syndrome decoding problem for rank distance codes. In: Advances in Cryptology\u2014ASIACRYPT 1996, vol. 1163, pp. 368\u2013381. LNCS. Springer, Kyongju (1996).","DOI":"10.1007\/BFb0034862"},{"key":"1265_CR29","doi-asserted-by":"publisher","unstructured":"Courtois N.: Efficient zero-knowledge authentication based on a linear algebra problem MinRank. In: Advances in Cryptology\u2014ASIACRYPT\u00a02001. LNCS, vol.\u00a02248, pp. 402\u2013421. Springer, Gold Coast, Australia (2001), https:\/\/doi.org\/10.1007\/3-540-45682-1_24.","DOI":"10.1007\/3-540-45682-1_24"},{"issue":"2","key":"1265_CR30","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-Solomon codes. Des. Codes Cryptogr. 73(2), 641\u2013666 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"1265_CR31","doi-asserted-by":"publisher","unstructured":"Cox D., Little J., O\u2019Shea D.: Ideals, Varieties, and algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. Springer, New York. (2015). https:\/\/doi.org\/10.1007\/978-3-319-16721-3.","DOI":"10.1007\/978-3-319-16721-3"},{"key":"1265_CR32","unstructured":"Debris-Alazard T., Tillich J.P.: A polynomial attack on a NIST proposal: Ranksign, a code-based signature in rank metric. Preprint, IACR Cryptology ePrint Archive (2018). https:\/\/eprint.iacr.org\/2018\/339.pdf."},{"key":"1265_CR33","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re J.C., Levy-dit-Vehel F., Perret L.: Cryptanalysis of Minrank. In: Wagner D. (ed.) Advances in Cryptology\u2014CRYPTO\u00a02008. LNCS, vol.\u00a05157, pp. 280\u2013296. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_16.","DOI":"10.1007\/978-3-540-85174-5_16"},{"issue":"1","key":"1265_CR34","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985).","journal-title":"Problemy Peredachi Informatsii"},{"key":"1265_CR35","doi-asserted-by":"crossref","unstructured":"Gabidulin E.M., Paramonov A.V., Tretjakov O.V.: Ideals over a non-commutative ring and their applications to cryptography. In: Advances in Cryptology\u2014EUROCRYPT\u201991. pp. 482\u2013489. LNCS, No.\u00a0547. Brighton (1991).","DOI":"10.1007\/3-540-46416-6_41"},{"issue":"12","key":"1265_CR36","doi-asserted-by":"publisher","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit P., Z\u00e9mor G.: On the hardness of the decoding and the minimum distance problems for rank codes. IEEE Trans. Inform. Theory 62(12), 7245\u20137252 (2016).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1265_CR37","doi-asserted-by":"publisher","unstructured":"Gaborit P., Schrek J., Z\u00e9mor G.: Full cryptanalysis of the chen identification protocol. In: Post-Quantum Cryptography\u20144th International Workshop, PQCrypto 2011, Taipei, Taiwan, 29 November\u20132 December 2011. Proceedings, pp. 35\u201350 (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_3.","DOI":"10.1007\/978-3-642-25405-5_3"},{"key":"1265_CR38","unstructured":"Gaborit P., Murat G., Ruatta O., Z\u00e9mor G.: Low rank parity check codes and their application to cryptography. In: Proceedings of the Workshop on Coding and Cryptography WCC\u20192013. Bergen, Norway (2013). www.selmer.uib.no\/WCC2013\/pdfs\/Gaborit.pdf."},{"key":"1265_CR39","doi-asserted-by":"crossref","unstructured":"Gaborit P., Ruatta O., Schrek J., Z\u00e9mor G.: New results for rank-based cryptography. In: Progress in Cryptology\u2014AFRICACRYPT\u00a02014. LNCS, vol.\u00a08469, pp. 1\u201312 (2014).","DOI":"10.1007\/978-3-319-06734-6_1"},{"issue":"2","key":"1265_CR40","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit P., Ruatta O., Schrek J.: On the complexity of the rank syndrome decoding problem. IEEE Trans. Inform. Theory 62(2), 1006\u20131019 (2016).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1265_CR41","doi-asserted-by":"publisher","unstructured":"Gaborit P., Hauteville A., Phan D.H., Tillich J.P.: Identity-based encryption from rank metric. In: Advances in Cryptology\u2014CRYPTO (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_7.","DOI":"10.1007\/978-3-319-63697-9_7"},{"key":"1265_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-44448-3_4","volume-title":"Advances in Cryptology\u2013ASIACRYPT 2000","author":"L Goubin","year":"2000","unstructured":"Goubin L., Courtois N.: Cryptanalysis of the TTM cryptosystem. In: Okamoto T. (ed.) Advances in Cryptology\u2013ASIACRYPT 2000, vol. 1976, pp. 44\u201357. LNCS. Springer, Berlin (2000)."},{"key":"1265_CR43","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler J. (ed.) Algorithmic Number Theory, 3rd International Symposium, ANTS-III, Portland, OR, USA, 21\u201325 June 1998, Proceedings. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Berlin (1998).","DOI":"10.1007\/BFb0054868"},{"key":"1265_CR44","doi-asserted-by":"publisher","unstructured":"Kipnis A., Shamir A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Advances in Cryptology\u2014CRYPTO\u201999. LNCS, vol. 1666, pp. 19\u201330. Springer, Santa Barbara (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1.","DOI":"10.1007\/3-540-48405-1"},{"key":"1265_CR45","unstructured":"Levy-dit-Vehel F., Perret L.: Algebraic decoding of rank metric codes. Talk at the Special Semester on Gr\u00f6bner Bases\u2014Workshop D1 pp. 1\u201319 (2006). https:\/\/ricamwww.ricam.oeaw.ac.at\/specsem\/srs\/groeb\/download\/Levy.pdf."},{"issue":"1","key":"1265_CR46","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10623-012-9716-0","volume":"71","author":"P Loidreau","year":"2014","unstructured":"Loidreau P.: Asymptotic behaviour of codes in rank metric over finite fields. Des. Codes Cryptogr. 71(1), 105\u2013118 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"1265_CR47","doi-asserted-by":"publisher","unstructured":"Misoczki R., Tillich J.P., Sendrier N., Barreto P.S.L.M.: MDPC-McEliece: New McEliece variants from moderate density parity-check codes (2012). https:\/\/doi.org\/10.1109\/ISIT.2013.6620590, http:\/\/eprint.iacr.org\/2012\/409.","DOI":"10.1109\/ISIT.2013.6620590"},{"issue":"3","key":"1265_CR48","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"AV Ourivski","year":"2002","unstructured":"Ourivski A.V., Johansson T.: New technique for decoding codes in the rank metric and its cryptography applications. Probl. Inf. Transm. 38(3), 237\u2013246 (2002). https:\/\/doi.org\/10.1023\/A:1020369320078.","journal-title":"Probl. Inf. Transm."},{"key":"1265_CR49","doi-asserted-by":"crossref","unstructured":"Overbeck R.: A new structural attack for GPT and variants. In: Mycrypt. LNCS, vol.\u00a03715, pp. 50\u201363 (2005).","DOI":"10.1007\/11554868_5"},{"key":"1265_CR50","doi-asserted-by":"publisher","unstructured":"Petzoldt A., Chen M., Yang B., Tao C., Ding J.: Design principles for HFEv- based multivariate signature schemes. In: Iwata T., Cheon J.H. (eds.) Advances in Cryptology\u2014ASIACRYPT 2015\u201421st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, 29 November\u20133 December 2015, Proceedings, Part I. LNCS, vol.\u00a09452, pp. 311\u2013334. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_14.","DOI":"10.1007\/978-3-662-48797-6_14"},{"issue":"4","key":"1265_CR51","first-page":"439","volume":"1","author":"VM Sidelnikov","year":"1992","unstructured":"Sidelnikov V.M., Shestakov S.: On the insecurity of cryptosystems based on generalized Reed-Solomon codes. Discret. Math. Appl. 1(4), 439\u2013444 (1992).","journal-title":"Discret. Math. Appl."},{"key":"1265_CR52","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology\u2013CRYPTO\u201993","author":"J Stern","year":"1993","unstructured":"Stern J.: A new identification scheme based on syndrome decoding. In: Stinson D. (ed.) Advances in Cryptology\u2013CRYPTO\u201993, vol. 773, pp. 13\u201321. LNCS. Springer, Berlin (1993)."},{"key":"1265_CR53","doi-asserted-by":"publisher","unstructured":"Tao C., Petzoldt A., Ding J.: Efficient key recovery for all HFE signature variants. In: Malkin T., Peikert C. (eds.) Advances in Cryptology\u2014CRYPTO 2021\u201441st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12825, pp. 70\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_4.","DOI":"10.1007\/978-3-030-84242-0_4"},{"key":"1265_CR54","doi-asserted-by":"publisher","unstructured":"Verbel J., Baena J., Cabarcas D., Perlner R., Smith-Tone D.: On the complexity of \u201csuperdetermined\u201d Minrank instances. In: Post-Quantum Cryptography\u00a02019. LNCS, vol. 11505, pp. 167\u2013186. Springer, Chongqing (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_10.","DOI":"10.1007\/978-3-030-25510-7_10"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01265-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01265-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01265-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T19:16:40Z","timestamp":1698175000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01265-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,19]]},"references-count":54,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1265"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01265-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,19]]},"assertion":[{"value":"23 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}