{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:58Z","timestamp":1778128078409,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"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":[[2024,4]]},"DOI":"10.1007\/s10623-023-01330-5","type":"journal-article","created":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T20:01:55Z","timestamp":1701979315000},"page":"1075-1093","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["LowMS: a new rank metric code-based KEM without ideal structure"],"prefix":"10.1007","volume":"92","author":[{"given":"Nicolas","family":"Aragon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Dyseryn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Loidreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Renner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,7]]},"reference":[{"key":"1330_CR1","unstructured":"Aguilar M.C., Nicolas A., Slim B., Lo\u00efc B., Olivier B., Jean-Christophe D., Philippe G., Gilles Z.: Rank quasi cyclic (RQC). First round submission to the NIST post-quantum cryptography call (November 2017)."},{"key":"1330_CR2","unstructured":"Aguilar M.C., Nicolas A., Slim B., Lo\u00efc B., Olivier B., Jean-Christophe D., Philippe G., Edoardo P., Gilles Z., Jurjen B.: HQC. Round 3 Submission to the NIST Post-Quantum Cryptography Call (June 2021). https:\/\/pqc-hqc.org\/."},{"key":"1330_CR3","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor C., Nicolas A., Victor D., Philippe G., Gilles Z.: LRPC codes with multiple syndromes: near ideal-size KEMs without ideals. In: International Conference on Post-Quantum Cryptography, pp. 45\u201368. Springer, Cham (2022).","DOI":"10.1007\/978-3-031-17234-2_3"},{"key":"1330_CR4","unstructured":"Al Abdouli A.S., Ali M.A., Bellini E., Caullery F., Hasikos A., Manzano M., Mateu V.: DRANKULA: a McEliece-like rank metric based cryptosystem implementation. Cryptology. ePrint Archive (2018)."},{"key":"1330_CR5","unstructured":"Alkim E., Bos J.W., Ducas L., Longa P., Mironov I.: FrodoKEM. In: 3rd Round Submission to the NIST (2021)."},{"key":"1330_CR6","doi-asserted-by":"crossref","unstructured":"Aragon N., Gaborit P., Hauteville A., Tillich J.-P.: A new algorithm for solving the rank syndrome decoding problem. In: Proceedings of IEEE ISIT (2018).","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"1330_CR7","unstructured":"Aragon N., Blazy O., Deneuville J.-C., Gaborit P., Hauteville Adrien R.O., Tillich J.-P., Z\u00e9mor G., Melchor C.A., Bettaieb S., Bidoux L., Magali B., Otmani A.: ROLLO (merger of Rank-Ouroboros, LAKE and LOCKER). In: Second Round Submission to the NIST Post-quantum Cryptography Call (March 2019)."},{"key":"1330_CR8","doi-asserted-by":"crossref","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, pp. 728\u2013758. Springer, Cham (2019).","DOI":"10.1007\/978-3-030-17659-4_25"},{"issue":"12","key":"1330_CR9","doi-asserted-by":"publisher","first-page":"7697","DOI":"10.1109\/TIT.2019.2933535","volume":"65","author":"N Aragon","year":"2019","unstructured":"Aragon N., Gaborit P., Hauteville A., Ruatta O., Z\u00e9mor G.: Low rank parity check codes: new decoding algorithms and applications to cryptography. IEEE Trans. Inf. Theory 65(12), 7697\u20137717 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1330_CR10","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. LNCS. Springer, Cham (2021)."},{"key":"1330_CR11","doi-asserted-by":"crossref","unstructured":"Berger T.P., Loidreau P.: Designing an efficient and secure public-key cryptosystem based on reducible rank codes. In: Progress in Cryptology\u2013INDOCRYPT 2004, vol. 3348, pp. 218\u2013229. LNCS. Springer, Berlin (2004).","DOI":"10.1007\/978-3-540-30556-9_18"},{"key":"1330_CR12","doi-asserted-by":"crossref","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: International Conference on the Theory and Application of Cryptology and Information Security, pp. 507\u2013536. Springer, Cham (2020).","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"1330_CR13","volume-title":"Classic McEliece","author":"DJ Bernstein","year":"2017","unstructured":"Bernstein D.J., Chou T., Lange T., von Maurich I., Misoczki R., Niederhagen R., Persichetti E., Peters C., Schwabe P., Sendrier N., et al.: Classic McEliece. Eindhoven University of Technology, Eindhoven (2017)."},{"key":"1330_CR14","unstructured":"Bidoux L., Briaud P., Bros M., Gaborit P.: RQC revisited and more cryptanalysis for rank-based cryptography. arXiv preprint (2022). arXiv:2207.01410."},{"key":"1330_CR15","doi-asserted-by":"crossref","unstructured":"Bos J., Ducas L., Kiltz E., Lepoint T., Lyubashevsky V., Schanck J.M., Schwabe P., Seiler G., Stehl\u00e9 D.: CRYSTALS-Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 353\u2013367. IEEE, Piscataway (2018).","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"1330_CR16","doi-asserted-by":"crossref","unstructured":"Briaud P., Loidreau P.: Cryptanalysis of rank-metric schemes based on distorted Gabidulin codes. In: Post-Quantum Cryptography 14th International Workshop PQCrypto (2023).","DOI":"10.1007\/978-3-031-40003-2_2"},{"issue":"9","key":"1330_CR17","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1007\/s10623-020-00781-4","volume":"88","author":"D Coggia","year":"2020","unstructured":"Coggia D., Couvreur A.: On the security of a Loidreau rank metric code based encryption scheme. Des. Codes Cryptogr. 88(9), 1941\u20131957 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1330_CR18","doi-asserted-by":"crossref","unstructured":"Debris-Alazard T., Tillich J.-P.: Two attacks on rank metric code-based schemes: Ranksign and an identity-based-encryption scheme. In: Advances in Cryptology - ASIACRYPT\u00a02018 (2018).","DOI":"10.1007\/978-3-030-03326-2_3"},{"key":"1330_CR19","unstructured":"Elleuch M., Wachter-Zeh A., Zeh A.: A public-key cryptosystem from interleaved Goppa codes. arXiv preprint (2018). arXiv:1809.03024."},{"key":"1330_CR20","doi-asserted-by":"crossref","unstructured":"Faure C., Loidreau P.: A new public-key cryptosystem based on the problem of reconstructing p-polynomials. In: Coding and Cryptography, International Workshop, WCC 2005 (2005).","DOI":"10.1007\/11779360_24"},{"key":"1330_CR21","doi-asserted-by":"crossref","unstructured":"Fujisaki E., Okamoto T.: Secure integration of asymmetric and symmetric encryption schemes. In: Advances in Cryptology-CRYPTO\u201999: 19th Annual International Cryptology Conference Santa Barbara, California, USA, 15\u201319 August 1999 Proceedings, pp. 537\u2013.554. Springer, Berlin (1999).","DOI":"10.1007\/3-540-48405-1_34"},{"issue":"1","key":"1330_CR22","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"},{"issue":"2","key":"1330_CR23","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10623-007-9160-8","volume":"48","author":"EM Gabidulin","year":"2008","unstructured":"Gabidulin E.M.: Attacks and counter-attacks on the GPT public key cryptosystem. Des. Codes Cryptogr. 48(2), 171\u2013177 (2008).","journal-title":"Des. Codes Cryptogr."},{"key":"1330_CR24","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 - EUROCRYPT\u201991, Brighton (1991)."},{"issue":"12","key":"1330_CR25","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":"1330_CR26","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, vol. 2013 (2013)."},{"key":"1330_CR27","doi-asserted-by":"crossref","unstructured":"Gaborit P., Hauteville A., Phan D.H., Tillich J.-P.: Identity-based encryption from rank metric. In: Advances in Cryptology\u2014CRYPTO (2017).","DOI":"10.1007\/978-3-319-63697-9_7"},{"issue":"1","key":"1330_CR28","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10623-021-00972-7","volume":"90","author":"A Ghatak","year":"2022","unstructured":"Ghatak A.: Extending Coggia-Couvreur attack on Loidreau\u2019s rank-metric cryptosystem. Des. Codes Cryptogr. 90(1), 215\u2013238 (2022).","journal-title":"Des. Codes Cryptogr."},{"key":"1330_CR29","doi-asserted-by":"crossref","unstructured":"Hofheinz D., H\u00f6velmanns K., Kiltz E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Theory of Cryptography Conference, pp. 341\u2013371. Springer, Cham (2017).","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"1330_CR30","doi-asserted-by":"crossref","unstructured":"Holzbaur L., Liu H., Puchinger S., Wachter-Zeh A.: On decoding and applications of interleaved Goppa codes. In: IEEE International Symposium on Information Theory (ISIT) (July 2019).","DOI":"10.1109\/ISIT.2019.8849600"},{"issue":"2","key":"1330_CR31","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00200-019-00406-x","volume":"32","author":"J-L Kim","year":"2021","unstructured":"Kim J.-L., Kim Y.-S., Galvez L.E., Kim M.J.: A modified dual-Ouroboros public-key encryption using Gabidulin codes. Appl. Algebra Eng. Commun. Comput. 32(2), 147\u2013156 (2021).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"6","key":"1330_CR32","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s00200-020-00419-x","volume":"32","author":"TSC Lau","year":"2021","unstructured":"Lau T.S.C., Tan C.-H., Prabowo T.F.: On the security of the modified Dual-Ouroboros PKE using Gabidulin codes. Appl. Algebra Eng. Commun. Comput. 32(6), 681\u2013699 (2021).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1330_CR33","unstructured":"Legeay M.: Permutation decoding: towards an approach using algebraic properties of the $$\\sigma $$-subcode. In: Augot D., Canteaut A. (eds.) WCC 2011, pp. 193\u2013202 (2011)."},{"key":"1330_CR34","unstructured":"Loidreau P.: Analysis of a public-key encryption scheme based on distorted Gabidulin codes. In: Proceedings of the 12th International Workshop on coding and Cryptography (WCC 2022). https:\/\/www.wcc2022.uni-rostock.de\/storages\/uni-rostock\/TAGUNGEN\/WCC2022\/Papers\/WCC_2022_paper_5.pdf."},{"key":"1330_CR35","unstructured":"Loidreau P.: Metrique rang et cryptographie. HDR thesis, Universit\u00e9 Pierre et Marie Curie-Paris VI (2007)."},{"key":"1330_CR36","unstructured":"Loidreau P.: Decoding rank errors beyond the error-correcting capability. In: ACCT 2010, 10th international workshop on Algebraic and Combinatorial Coding Theory (2006)."},{"key":"1330_CR37","doi-asserted-by":"crossref","unstructured":"Loidreau P.: A new rank metric codes based encryption scheme. In: Post-Quantum Cryptography\u00a02017, vol. 10346. LNCS, pp. 3\u201317. Springer, Cham (2017).","DOI":"10.1007\/978-3-319-59879-6_1"},{"key":"1330_CR38","unstructured":"Loidreau P., Overbeck R.: Decoding rank errors beyond the error-correction capability. In: Proceedings of the 10th International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-10, pp. 168\u2013190 (2006)."},{"key":"1330_CR39","unstructured":"Loidreau P., Pham B.-D.: An analysis of Coggia-Couvreur attack on Loidreau\u2019s rank-metric public key encryption scheme in the general case. CoRR (2021). arXiv:2112.12445."},{"key":"1330_CR40","unstructured":"McEliece R.J.: A public-key system based on algebraic coding theory, pp. 114\u2013116. Jet Propulsion Lab (1978). DSN Progress Report 44."},{"issue":"4","key":"1330_CR41","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"},{"issue":"2","key":"1330_CR42","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theory 15(2), 159\u2013166 (1986).","journal-title":"Probl. Control Inf. Theory"},{"issue":"2","key":"1330_CR43","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).","journal-title":"J. Cryptol."},{"key":"1330_CR44","unstructured":"Pham B.D.: \u00c9tude et conception de nouvelles primitives de chiffrement fond\u00e9es sur les codes correcteurs d\u2019erreurs en m\u00e9trique rang. PhD thesis, Rennes 1 (2021)."},{"key":"1330_CR45","doi-asserted-by":"crossref","unstructured":"Renner J., Puchinger S., Wachter-Zeh A.: Interleaving Loidreau\u2019s rank-metric cryptosystem. In: 2019 XVI International Symposium \u201cProblems of Redundancy in Information and Control Systems\u201d (REDUNDANCY), pp. 127\u2013132. IEEE, Piscataway (2019).","DOI":"10.1109\/REDUNDANCY48165.2019.9003318"},{"key":"1330_CR46","doi-asserted-by":"crossref","unstructured":"Renner J., Puchinger S., Wachter-Zeh A.: Decoding high-order interleaved rank-metric codes. In: 2021 IEEE International Symposium on Information Theory (ISIT), pp. 19\u201324. IEEE, Piscataway (2021).","DOI":"10.1109\/ISIT45174.2021.9518085"},{"key":"1330_CR47","unstructured":"Shor P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: Goldwasser S. (ed.) FOCS, pp. 124\u2013134. IEEE Computer Society Press, Los Alamitos (1994)."},{"issue":"2","key":"1330_CR48","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TIT.2010.2096032","volume":"57","author":"V Sidorenko","year":"2011","unstructured":"Sidorenko V., Jiang L., Bossert M.: Skew-feedback shift-register synthesis and decoding interleaved Gabidulin codes. IEEE Trans. Inf. Theory 57(2), 621\u2013632 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1330_CR49","doi-asserted-by":"crossref","unstructured":"Wang L.-P.: Loong: a new IND-CCA-secure code-based KEM. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 2584\u20132588. IEEE, Piscataway (2019).","DOI":"10.1109\/ISIT.2019.8849302"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01330-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01330-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01330-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T18:08:59Z","timestamp":1713290939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01330-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,7]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1330"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01330-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,7]]},"assertion":[{"value":"19 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}