{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:51:08Z","timestamp":1765961468081,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,21]],"date-time":"2021-11-21T00:00:00Z","timestamp":1637452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,21]],"date-time":"2021-11-21T00:00:00Z","timestamp":1637452800000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10623-021-00972-7","type":"journal-article","created":{"date-parts":[[2021,11,21]],"date-time":"2021-11-21T15:03:20Z","timestamp":1637507000000},"page":"215-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Extending Coggia\u2013Couvreur attack on Loidreau\u2019s rank-metric cryptosystem"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8654-2411","authenticated-orcid":false,"given":"Anirban","family":"Ghatak","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,21]]},"reference":[{"key":"972_CR1","volume-title":"Finite Collineation Groups: With an Introduction to the Theory of Groups of Operators and Substitution Groups","author":"HF Blichfeldt","year":"1917","unstructured":"Blichfeldt H.F.: Finite Collineation Groups: With an Introduction to the Theory of Groups of Operators and Substitution Groups. University of Chicago Press, Chicago (1917)."},{"unstructured":"Coggia D., Couvreur A.: On the security of a Loidreau\u2019s rank metric code based encryption scheme. http:\/\/arxiv.org\/abs\/1903.02933 (2019)","key":"972_CR2"},{"issue":"9","key":"972_CR3","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 Crypt. 88(9), 1941\u20131957 (2020).","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"972_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226\u2013241 (1978).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"972_CR5","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1090\/S0894-0347-08-00607-3","volume":"22","author":"Z Dvir","year":"2009","unstructured":"Dvir Z.: On the size of Kakeya sets in finite fields. J. Am. Math. Soc. 22(4), 1093\u20131097 (2009).","journal-title":"J. Am. Math. Soc."},{"doi-asserted-by":"crossref","unstructured":"Faure C., Loidreau P.: A new public-key cryptosystem based on the problem of reconstructing p-polynomials. In: International Workshop on Coding and Cryptography, pp. 304\u2013315. Springer (2005)","key":"972_CR6","DOI":"10.1007\/11779360_24"},{"issue":"1","key":"972_CR7","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"},{"doi-asserted-by":"crossref","unstructured":"Gabidulin E.M., Paramonov A., Tretjakov O.: Ideals over a non-commutative ring and their application in cryptology. In: Workshop on the Theory and Application of Cryptographic Techniques, pp. 482\u2013489. Springer (1991)","key":"972_CR8","DOI":"10.1007\/3-540-46416-6_41"},{"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":"972_CR9"},{"issue":"7","key":"972_CR10","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1007\/s10623-017-0402-0","volume":"86","author":"P Gaborit","year":"2018","unstructured":"Gaborit P., Otmani A., Kalachi H.T.: Polynomial-time key recovery attack on the Faure\u2013Loidreau scheme based on Gabidulin codes. Des. Codes Crypt. 86(7), 1391\u20131403 (2018).","journal-title":"Des. Codes Crypt."},{"key":"972_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective Geometries Over Finite Fields","author":"J Hirschfeld","year":"1998","unstructured":"Hirschfeld J.: Projective Geometries Over Finite Fields. Oxford University Press, Oxford (1998)."},{"key":"972_CR12","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H., Cohn P., Rota G., Doran B., Flajolet P., Ismail M., Lam T., Lutwak E.: Finite Fields. Cambridge University Press, Cambridge (1997)."},{"key":"972_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11779360_4","volume-title":"Coding Cryptogr.","author":"P Loidreau","year":"2006","unstructured":"Loidreau P.: A Welch\u2013Berlekamp like algorithm for decoding Gabidulin codes. In: Ytrehus \u00d8. (ed.) Coding Cryptogr., pp. 36\u201345. Springer, Berlin (2006)."},{"doi-asserted-by":"crossref","unstructured":"Loidreau P.: A new rank metric codes based encryption scheme. In: International Workshop on Post-Quantum Cryptography, pp. 3\u201317. Springer (2017)","key":"972_CR14","DOI":"10.1007\/978-3-319-59879-6_1"},{"unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Progress Report pp. 42\u201344 (1978)","key":"972_CR15"},{"issue":"2","key":"972_CR16","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."},{"unstructured":"Puchinger S., Renner J., Wachter-Zeh A.: Twisted Gabidulin codes in the gpt cryptosystem. arXiv:1806.10055 (2018)","key":"972_CR17"},{"unstructured":"Stein W., et\u00a0al.: Sage Mathematics Software (Version 7.5.1). The Sage Development Team (2017). http:\/\/www.sagemath.org","key":"972_CR18"},{"key":"972_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra","author":"J von zur Gathen","year":"2013","unstructured":"von zur Gathen J., Gerhard J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2013)."},{"issue":"171","key":"972_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1090\/S0025-5718-1985-0790658-X","volume":"45","author":"J von\u00a0zur Gathen","year":"1985","unstructured":"von\u00a0zur Gathen J., Kaltofen E.: Factorization of multivariate polynomials over finite fields. Math. Comput. 45(171), 251\u2013261 (1985).","journal-title":"Math. Comput."},{"issue":"1\u20133","key":"972_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9659-5","volume":"66","author":"A Wachter-Zeh","year":"2013","unstructured":"Wachter-Zeh A., Afanassiev V.B., Sidorenko V.: Fast decoding of Gabidulin codes. Des. Codes Cryptogr. 66(1\u20133), 57\u201373 (2013). https:\/\/doi.org\/10.1007\/s10623-012-9659-5.","journal-title":"Des. Codes Cryptogr."},{"doi-asserted-by":"crossref","unstructured":"Wachter-Zeh A., Puchinger S., Renner J.: Repairing the faure-loidreau public-key cryptosystem. In: 2018 IEEE International Symposium on Information Theory (ISIT), pp. 2426\u20132430. IEEE (2018)","key":"972_CR22","DOI":"10.1109\/ISIT.2018.8437561"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00972-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00972-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00972-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T23:01:22Z","timestamp":1699830082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00972-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,21]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["972"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00972-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2021,11,21]]},"assertion":[{"value":"18 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}