{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T21:51:37Z","timestamp":1774907497904,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T00:00:00Z","timestamp":1188950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00145-007-9003-9","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T19:09:07Z","timestamp":1188932947000},"page":"280-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":108,"title":["Structural Attacks for Public Key Cryptosystems based\u00a0on Gabidulin Codes"],"prefix":"10.1007","volume":"21","author":[{"given":"R.","family":"Overbeck","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,5]]},"reference":[{"key":"9003_CR1","volume-title":"IEEE International Symposium on Information Theory, Lausanne, Suisse","author":"T.P. Berger","year":"2002","unstructured":"T.P. Berger, P. Loidreau, Security of the Niederreiter form of the GPT public-key cryptosystem, in IEEE International Symposium on Information Theory, Lausanne, Suisse (IEEE Press, New York, 2002)"},{"issue":"1","key":"9003_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"T.P. Berger","year":"2005","unstructured":"T.P. Berger, P. Loidreau, How to mask the structure of codes for a cryptographic use, Des. Codes Cryptogr.\n                           35(1), 63\u201379 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"9003_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2001","author":"N. Courtois","year":"2001","unstructured":"N. Courtois, M. Finiasz, N. Sendrier, How to achieve a McEliece-based digital signature scheme, in Advances in Cryptology\u2014ASIACRYPT 2001, vol. 2248 (Springer, Berlin, 2001), pp. 157\u2013174"},{"key":"9003_CR4","doi-asserted-by":"crossref","unstructured":"S.R. Finch, Mathematical Constants. Encyclopedia of Mathematics and Applications. Cambridge, 2003. See \n                    http:\/\/mathworld.wolfram.com\/InfiniteProduct.html","DOI":"10.1017\/CBO9780511550447"},{"key":"9003_CR5","series-title":"Codes and Ciphers","volume-title":"Proc. of 4th IMA Conference on Cryptography and Coding 1993","author":"E.M. Gabidulin","year":"1995","unstructured":"E.M. Gabidulin, On public-key cryptosystems based on linear codes, in Proc. of 4th IMA Conference on Cryptography and Coding 1993. Codes and Ciphers (IMA Press, Southend-on Sea, 1995)"},{"key":"9003_CR6","unstructured":"E.M. Gabidulin, P. Loidreau, Subfield subcodes of maximum-rank distance codes, in Seventh International Workshop on Algebraic and Combinatorial Coding Theory. ACCT, vol.\u00a07, pp.\u00a0151\u2013156 (2000)"},{"issue":"1","key":"9003_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0166-218X(02)00446-8","volume":"128","author":"E.M. Gabidulin","year":"2003","unstructured":"E.M. Gabidulin, A.V. Ourivski, Column scrambler for the GPT cryptosystem, Discrete Appl. Math.\n                           128(1), 207\u2013221 (2003)","journal-title":"Discrete Appl. Math."},{"key":"9003_CR8","series-title":"LNCS","volume-title":"Proc. Eurocrypt \u201991","author":"E.M. Gabidulin","year":"1991","unstructured":"E.M. Gabidulin, A.V. Paramonov, O.V. Tretjakov, Ideals over a non-commutative ring and their applications to cryptography, in Proc. Eurocrypt \u201991. LNCS, vol. 547 (Springer, Berlin, 1991)"},{"issue":"12","key":"9003_CR9","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1109\/TIT.2003.820038","volume":"49","author":"E.M. Gabidulin","year":"2003","unstructured":"E.M. Gabidulin, A.V. Ourivski, B. Honary, B. Ammar, Reducible rank codes and their applications to cryptography, IEEE Trans. Inform. Theory\n                           49(12), 3289\u20133293 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"9003_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"J.K. Gibson","year":"1995","unstructured":"J.K. Gibson, Severely denting the Gabidulin version of the McEliece public key cryptosystem, Des. Codes Cryptogr.\n                           6(1), 37\u201345 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"9003_CR11","series-title":"LNCS","first-page":"212","volume-title":"Proc. of Eurocrypt\u201996","author":"K. Gibson","year":"1996","unstructured":"K. Gibson, The security of the Gabidulin public key cryptosystem, in Proc. of Eurocrypt\u201996. LNCS, vol. 1070 (Springer, Berlin, 1996), pp. 212\u2013223"},{"issue":"3","key":"9003_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"T. Johansson","year":"2002","unstructured":"T. Johansson, A.V. Ourivski, New technique for decoding codes in the rank metric and its cryptography applications, Problems Inform. Transm.\n                           38(3), 237\u2013246 (2002)","journal-title":"Problems Inform. Transm."},{"key":"9003_CR13","unstructured":"P. Loidreau, R. Overbeck, Decoding rank errors beyond the error-correction capability, in Proc. of ACCT-10, Zvenigorod (2006)"},{"key":"9003_CR14","first-page":"114","volume":"42\u201344","author":"R.J. McEliece","year":"1978","unstructured":"R.J. McEliece, A public key cryptosystem based on algebraic coding theory, DSN Prog. Rep.\n                           42\u201344, 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"key":"9003_CR15","unstructured":"A.V. Ourivski, Recovering a parent code for subcodes of maximal rank distance codes, in Proc. of WCC 03, pp.\u00a0357\u2013363 (2003)"},{"key":"9003_CR16","unstructured":"R. Overbeck, Decoding interleaved Gabidulin codes and ciphertext-security for GPT variants. Available at \n                    http:\/\/eprint.iacr.org\/2006\/222"},{"key":"9003_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11554868_5","volume-title":"Proc. of Mycrypt 2005","author":"R. Overbeck","year":"2005","unstructured":"R. Overbeck, A new structural attack for GPT and variants, in Proc. of Mycrypt 2005. LNCS, vol. 3715 (Springer, Berlin, 2005), pp. 50\u201363"},{"key":"9003_CR18","series-title":"LNCS","first-page":"178","volume-title":"Proc. of WCC 2005","author":"R. Overbeck","year":"2006","unstructured":"R. Overbeck, Extending Gibson\u2019s attacks on the GPT cryptosystem, in Proc. of WCC 2005. LNCS, vol. 3969 (Springer, Berlin, 2006), pp. 178\u2013188"},{"key":"9003_CR19","unstructured":"M. Ogle, T. Migler, K.E. Morrison, Weight and rank of matrices over finite fields, 2003. Available at \n                    http:\/\/www.calpoly.edu\/~kmorriso\/Research\/research.html"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9003-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-007-9003-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9003-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9003-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:37:27Z","timestamp":1586335047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-007-9003-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,5]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["9003"],"URL":"https:\/\/doi.org\/10.1007\/s00145-007-9003-9","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,5]]},"assertion":[{"value":"17 October 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2007","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}