{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:38:27Z","timestamp":1779359907209,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,11,2]],"date-time":"2017-11-02T00:00:00Z","timestamp":1509580800000},"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,9]]},"DOI":"10.1007\/s10623-017-0434-5","type":"journal-article","created":{"date-parts":[[2017,11,2]],"date-time":"2017-11-02T01:14:27Z","timestamp":1509585267000},"page":"1983-1996","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Improved cryptanalysis of rank metric schemes based on Gabidulin codes"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8176-8692","authenticated-orcid":false,"given":"Ayoub","family":"Otmani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herv\u00e9 Tal\u00e9","family":"Kalachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9lestin","family":"Ndjeya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"434_CR1","doi-asserted-by":"crossref","unstructured":"Shor P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Goldwasser S. (ed.) FOCS, pp. 124\u2013134 (1994).","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"5","key":"434_CR2","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997).","journal-title":"SIAM J. Comput."},{"key":"434_CR3","unstructured":"McEliece R.J.: A public-key system based on algebraic coding theory, pp. 114\u2013116. Jet Propulsion Lab (1978). DSN Progress Report 44."},{"key":"434_CR4","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 Computer Science, pp. 482\u2013489. Brighton (1991)."},{"issue":"1","key":"434_CR5","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":"434_CR6","doi-asserted-by":"crossref","unstructured":"Gibson K.: The security of the Gabidulin public key cryptosystem. In: Ueli M. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201996. Lecture Notes in Computer Science, vol. 1070, pp. 212\u2013223. Springer, New York (1996).","DOI":"10.1007\/3-540-68339-9_19"},{"key":"434_CR7","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 Discret. Math. 6, 168\u2013177 (2001).","journal-title":"Electron. Notes Discret. Math."},{"issue":"12","key":"434_CR8","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. Inform. Theory 49(12), 3289\u20133293 (2003).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"434_CR9","unstructured":"Overbeck R.: Extending Gibson\u2019s attacks on the GPT cryptosystem. In: Oyvind Y. (ed.) WCC 2005. Lecture Notes in Computer Science, vol. 3969, pp. 178\u2013188. Springer, New York (2005)."},{"key":"434_CR10","doi-asserted-by":"crossref","unstructured":"Overbeck R.: A new structural attack for GPT and variants. In: Mycrypt. Lecture Notes in Computer Science, vol. 3715, pp. 50\u201363 (2005).","DOI":"10.1007\/11554868_5"},{"issue":"2","key":"434_CR11","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":"434_CR12","doi-asserted-by":"crossref","unstructured":"Loidreau P.: Designing a rank metric based McEliece cryptosystem. In: Nicolas S. (ed.) Post-Quantum Cryptography. Lecture Notes in Computer Science, vol. 6061, pp. 142\u2013152. Springer, New York (2010).","DOI":"10.1007\/978-3-642-12929-2_11"},{"key":"434_CR13","doi-asserted-by":"crossref","unstructured":"Rashwann H., Gabidulin E., Honary B.: A smart approach for GPT cryptosystem based on rank codes. In: Proceedings IEEE International Symposium Information Theory\u2014ISIT, pp. 2463\u20132467 (2010).","DOI":"10.1109\/ISIT.2010.5513549"},{"issue":"2","key":"434_CR14","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."},{"key":"434_CR15","doi-asserted-by":"crossref","unstructured":"Gabidulin E., Rashwan H., Honary B.: On improving security of GPT cryptosystems. In: Proceedings of IEEE International Symposium on Theory\u2014ISIT, pp. 1110\u20131114 (2009).","DOI":"10.1109\/ISIT.2009.5206029"},{"issue":"8","key":"434_CR16","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."},{"issue":"2","key":"434_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. Inform. Theory 62(2), 1006\u20131019 (2016).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"434_CR18","doi-asserted-by":"crossref","unstructured":"Horlemann-Trautmann A-L, Marshall K, Rosenthal J: Considerations for rank-based cryptosystems. In: IEEE International Symposium on Information Theory (ISIT), pp. 2544\u20132548 (2016).","DOI":"10.1109\/ISIT.2016.7541758"},{"key":"434_CR19","doi-asserted-by":"crossref","unstructured":"Horlemann-Trautmann A-L, Marshall K, Rosenthal J.: Extension of overbeck\u2019s attack for gabidulin based cryptosystems. Des. Codes Cryptogr. (2017).","DOI":"10.1007\/s10623-017-0343-7"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0434-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0434-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0434-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T09:11:08Z","timestamp":1570266668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0434-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,2]]},"references-count":19,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["434"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0434-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,2]]}}}