{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:00:52Z","timestamp":1767992452300,"version":"3.49.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T00:00:00Z","timestamp":1201651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10623-007-9160-8","type":"journal-article","created":{"date-parts":[[2008,1,29]],"date-time":"2008-01-29T15:09:22Z","timestamp":1201619362000},"page":"171-177","source":"Crossref","is-referenced-by-count":32,"title":["Attacks and counter-attacks on the GPT public key cryptosystem"],"prefix":"10.1007","volume":"48","author":[{"given":"Ernst M.","family":"Gabidulin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,30]]},"reference":[{"key":"9160_CR1","unstructured":"McEliece, R.J.: A Public Key Cryptosystem Based on Algebraic Coding Theory. JPL DSN Progress Report 42\u201344, pp. 114\u2013116. Pasadena, CA (1978)."},{"key":"9160_CR2","doi-asserted-by":"crossref","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) Advances in Cryptology\u2014Eurocrypt \u201991. Lecture Notes in Computer Science, No 547, pp. 482\u2013489. Springer-Verlag, Berlin and Heidelberg (1991).","DOI":"10.1007\/3-540-46416-6_41"},{"key":"9160_CR3","first-page":"17","volume-title":"Codes and Ciphers","author":"E.M. Gabidulin","year":"1995","unstructured":"Gabidulin E.M. (1995). Public-key cryptosystems based on linear codes over large alphabets: efficiency and weakness. In: Farrell P.G. (ed) Codes and Ciphers. Formara Limited, Essex, pp. 17\u201332"},{"issue":"1","key":"9160_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"J.K. Gibson","year":"1995","unstructured":"Gibson J.K. (1995). Severely denting the Gabidulin version of the McEliece public key cryptosystem. Des. Codes Cryptogr. 6(1): 37\u201345","journal-title":"Des. Codes Cryptogr."},{"key":"9160_CR5","doi-asserted-by":"crossref","unstructured":"Gibson, J.K.: The security of the Gabidulin public-key cryptosystem. In: Maurer, U.M. (ed.) Advances in Cryptology\u2014 EUROCRYPT\u201996, LNCS 1070, pp. 212\u2013223 (1996).","DOI":"10.1007\/3-540-68339-9_19"},{"key":"9160_CR6","first-page":"73","volume-title":"Coding, Communications, and Broadcasting","author":"E.M. Gabidulin","year":"2000","unstructured":"Gabidulin E.M., Ourivski A.V. (2000). Improved GPT public key cryptosystems. In: Farrell P., Darnell M., Honary B. (eds) Coding, Communications, and Broadcasting. Research Studies Press, Ciphertext, pp. 73\u2013102"},{"issue":"1","key":"9160_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0166-218X(02)00446-8","volume":"128","author":"A.V. Ourivski","year":"2003","unstructured":"Ourivski A.V., Gabidulin E.M. (2003). Column scrambler for the GPT cryptosystem. Discrete Appl. Math. 128(1): 207\u2013221","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"9160_CR8","doi-asserted-by":"crossref","first-page":"3289","DOI":"10.1109\/TIT.2003.820038","volume":"49","author":"E.M. Gabidulin","year":"2003","unstructured":"Gabidulin E.M., Ourivski A.V., Honary B., Ammar B. (2003). Reducible rank codes and their applications to cryptography. IEEE Trans. Inf. Theory 49(12): 3289\u20133293","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9160_CR9","unstructured":"Kshevetskiy, A.S., Gabidulin, E.M.: High-weight errors in public-key cryptosystems based on reducible rank codes. ISCTA (2005)."},{"key":"9160_CR10","unstructured":"Overbeck, R.: A new structural attack for GPT and variants. In: Proc. of Mycrypt\u20192005, vol. 3517 of LNCS, pp. 5\u201363. Springer-Verlag (2005)."},{"issue":"1","key":"9160_CR11","first-page":"1","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"Gabidulin E.M. (1985). Theory of codes with maximum rank distance. Probl. Inform. Transm. 21(1): 1\u201312","journal-title":"Probl. Inform. Transm."},{"key":"9160_CR12","doi-asserted-by":"crossref","unstructured":"Gabidulin, E.M.: A fast matrix decoding algorithm for rank-error-correcting codes. In: Cohen, G., Litsyn, S., Lobstein, A., Zemor, G.(eds.) Algebraic Coding, pp. 126\u2013132. Lecture Notes in Computer Science No. 573. Springer-Verlag, Berlin (1992).","DOI":"10.1007\/BFb0034349"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9160-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9160-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9160-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:50:09Z","timestamp":1559231409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9160-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,30]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9160"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9160-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,30]]}}}