{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:24:33Z","timestamp":1761395073221,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T00:00:00Z","timestamp":1503014400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10623-017-0402-0","type":"journal-article","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T00:10:42Z","timestamp":1503015042000},"page":"1391-1403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Polynomial-time key recovery attack on the Faure\u2013Loidreau scheme based on Gabidulin codes"],"prefix":"10.1007","volume":"86","author":[{"given":"Philippe","family":"Gaborit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8176-8692","authenticated-orcid":false,"given":"Ayoub","family":"Otmani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herv\u00e9 Tal\u00e9","family":"Kalachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,18]]},"reference":[{"key":"402_CR1","doi-asserted-by":"crossref","unstructured":"Augot D., Finiasz M.: A public key encryption scheme based on the polynomial reconstruction problem. In: Advances in Cryptology\u2014EUROCRYPT\u00a02003, volume 2656 of Lecture Notes in Comput. Sci., pp. 229\u2013240. Springer (2003).","DOI":"10.1007\/3-540-39200-9_14"},{"key":"402_CR2","first-page":"209","volume":"2003","author":"D Augot","year":"2003","unstructured":"Augot D., Finiasz M., Loidreau P.: Using the trace operator to repair the polynomial reconstruction based cryptosystem presented at eurocrypt 2003. IACR Cryptol. ePrint Arch. 2003, 209 (2003).","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"11","key":"402_CR3","doi-asserted-by":"crossref","first-page":"3016","DOI":"10.1109\/TIT.2003.819322","volume":"49","author":"TP Berger","year":"2003","unstructured":"Berger T.P.: Isometries for rank distance and permutation group of gabidulin codes. IEEE Trans. Inf. Theory 49(11), 3016\u20133019 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"402_CR4","doi-asserted-by":"crossref","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":"402_CR5","first-page":"219","volume":"2003","author":"J-S Coron","year":"2003","unstructured":"Coron J.-S.: Cryptanalysis of the repaired public-key encryption scheme based on the polynomial reconstruction problem. IACR Cryptol. ePrint Arch. 2003, 219 (2003).","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"402_CR6","doi-asserted-by":"crossref","unstructured":"Coron J.-S.: Cryptanalysis of a public-key encryption scheme based on the polynomial reconstruction problem. In: Public Key Cryptography\u2014PKC 2004, 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, March 1\u20134, 2004, pp. 14\u201327 (2004).","DOI":"10.1007\/978-3-540-24632-9_2"},{"key":"402_CR7","doi-asserted-by":"crossref","unstructured":"Couvreur A., Otmani A., Tillich J.-P.: Polynomial time attack on wild McEliece over quadratic extensions. In: Nguyen P.Q., Oswald E. (eds.) Advances in Cryptology\u2014EUROCRYPT\u00a02014, volume 8441 of Lecture Notes in Comput. Sci., pp. 17\u201339. Springer, Berlin (2014).","DOI":"10.1007\/978-3-642-55220-5_2"},{"key":"402_CR8","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, Bergen, Norway, March 14\u201318, 2005. Revised Selected Papers, pp. 304\u2013315 (2005)."},{"issue":"1","key":"402_CR9","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":"402_CR10","doi-asserted-by":"crossref","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."},{"issue":"1","key":"402_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"K Gibson","year":"1995","unstructured":"Gibson K.: Severely denting the Gabidulin version of the McEliece public key cryptosystem. Des. Codes Cryptogr. 6(1), 37\u201345 (1995).","journal-title":"Des. Codes Cryptogr."},{"key":"402_CR12","doi-asserted-by":"crossref","unstructured":"Gibson K.: The security of the Gabidulin public key cryptosystem. In: Ueli M. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201996, volume 1070 of Lecture Notes in Comput. Sci., pp. 212\u2013223. Springer (1996).","DOI":"10.1007\/3-540-68339-9_19"},{"key":"402_CR13","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/S1571-0653(04)00168-4","volume":"6","author":"EM Gabidulin","year":"2001","unstructured":"Gabidulin E.M., Ourivski A.V.: Modified GPT PKC with right scrambler. Electron. Notes Discrete Math. 6, 168\u2013177 (2001).","journal-title":"Electron. Notes Discrete Math."},{"issue":"12","key":"402_CR14","doi-asserted-by":"crossref","first-page":"3289","DOI":"10.1109\/TIT.2003.820038","volume":"49","author":"EM Gabidulin","year":"2003","unstructured":"Gabidulin E.M., Ourivski A.V., Honary B., Ammar B.: Reducible rank codes and their applications to cryptography. IEEE Trans. Inf. Theory 49(12), 3289\u20133293 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"402_CR15","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, number 547 in Lecture Notes in Comput. Sci., pp. 482\u2013489. Brighton (1991)."},{"key":"402_CR16","doi-asserted-by":"crossref","unstructured":"Gabidulin E., Rashwan H., Honary B.: On improving security of GPT cryptosystems. In: Proceedings of the IEEE International Symposium on Information Theory\u2014ISIT, pp. 1110\u20131114. IEEE (2009).","DOI":"10.1109\/ISIT.2009.5206029"},{"issue":"2","key":"402_CR17","doi-asserted-by":"crossref","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. Inf. Theory 62(2), 1006\u20131019 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"402_CR18","doi-asserted-by":"crossref","unstructured":"Kiayias A., Yung M.: Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice. In: Advances in Cryptology\u2014ASIACRYPT 2004, 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, December 5\u20139, 2004, Proceedings, pp. 401\u2013416 (2004).","DOI":"10.1007\/978-3-540-30539-2_28"},{"key":"402_CR19","unstructured":"Loidreau P., Raphael O.: Decoding rank errors beyond the error-correction capability. In: Proceedings of the Tenth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-10, pp. 168\u2013190 (2006)."},{"key":"402_CR20","unstructured":"Loidreau P.: Rank metric and cryptography. Accreditation to supervise research, Universit\u00e9 Pierre et Marie Curie\u2014Paris VI (2007)."},{"key":"402_CR21","doi-asserted-by":"crossref","unstructured":"Loidreau P.: Designing a rank metric based McEliece cryptosystem. In: Sendrier N. (ed.) Post-Quantum Cryptography\u00a02010, volume 6061 of Lecture Notes in Comput. Sci., pp. 142\u2013152. Springer (2010).","DOI":"10.1007\/978-3-642-12929-2_11"},{"key":"402_CR22","unstructured":"McEliece R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114\u2013116. Jet Propulsion Lab. DSN Progress Report 44 (1978)"},{"key":"402_CR23","doi-asserted-by":"crossref","unstructured":"Otmani A., Kalachi H.T.: Square code attack on a modified Sidelnikov cryptosystem. In: El Hajji S., Nitaj A., Carlet C., El\u00a0Mamoun S. (eds) Codes, Cryptology, and Information Security\u2014FirstInternational Conference, C2SI 2015, Rabat, Morocco, May 26\u201328, 2015, Proceedings\u2014In Honor of Thierry Berger, volume 9084 of Lecture Notesin Computer Science, pp. 173\u2013183. Springer (2015).","DOI":"10.1007\/978-3-319-18681-8_14"},{"key":"402_CR24","doi-asserted-by":"crossref","unstructured":"Otmani A., Kalachi H.T., Ndjeya S.: Improved cryptanalysis of rank metric schemes based on Gabidulin codes. arXiv:1602.08549 (2016).","DOI":"10.1007\/s10623-017-0434-5"},{"key":"402_CR25","unstructured":"Overbeck R.: Extending Gibson\u2019s attacks on the GPT cryptosystem. In: Ytrehus O. (ed.) WCC 2005, volume 3969 of Lecture Notes in Comput. Sci., pp. 178\u2013188. Springer (2005)."},{"key":"402_CR26","doi-asserted-by":"crossref","unstructured":"Overbeck R.: A new structural attack for GPT and variants. In: Mycrypt, volume 3715 of Lecture Notes in Comput. Sci., pp. 50\u201363 (2005).","DOI":"10.1007\/11554868_5"},{"issue":"2","key":"402_CR27","doi-asserted-by":"crossref","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":"402_CR28","doi-asserted-by":"crossref","unstructured":"Rashwan H., Gabidulin E., Honary B.: A smart approach for GPT cryptosystem based on rank codes. In: Proceedings of the IEEE International Symposium on Information Theory\u2014ISIT, pp. 2463\u20132467. IEEE (2010).","DOI":"10.1109\/ISIT.2010.5513549"},{"issue":"8","key":"402_CR29","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1002\/sec.228","volume":"4","author":"H Rashwan","year":"2011","unstructured":"Rashwan H., Gabidulin E., Honary B.: Security of the GPT cryptosystem and its applications to cryptography. Secur. Commun. Netw. 4(8), 937\u2013946 (2011).","journal-title":"Secur. Commun. Netw."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0402-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0402-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0402-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T10:39:39Z","timestamp":1570012779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0402-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,18]]},"references-count":29,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["402"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0402-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2017,8,18]]}}}