{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:37Z","timestamp":1759639057302},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00446-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"207-221","source":"Crossref","is-referenced-by-count":24,"title":["Column scrambler for the GPT cryptosystem"],"prefix":"10.1016","volume":"128","author":[{"given":"A.V.","family":"Ourivski","sequence":"first","affiliation":[]},{"given":"E.M.","family":"Gabidulin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(02)00446-8_BIB1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/18.651067","article-title":"A new algorithm for finding minimum-weight words in a linear code","volume":"IT-44","author":"Canteaut","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"10.1016\/S0166-218X(02)00446-8_BIB2","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0166-218X(02)00446-8_BIB3","series-title":"Codes and Ciphers: Cryptography and Coding IV","first-page":"17","article-title":"On public-key cryptosystems based on linear codes over large alphabets: efficiency and weakness","author":"Gabidulin","year":"1995"},{"key":"10.1016\/S0166-218X(02)00446-8_BIB4","unstructured":"E.M. Gabidulin, A.V. Ourivski, Improved GPT public key cryptosystems, in: P. Farrell, M. Darnell, B. Honary (Eds.), Coding, Communications and Broadcasting, Research Studies Press, London 2000, pp. 73\u2013102."},{"key":"10.1016\/S0166-218X(02)00446-8_BIB5","series-title":"Advances in Cryptology\u2014EUROCRYPT\u201991","first-page":"482","article-title":"Ideals over a non-commutative ring and their application in cryptology","volume":"Vol. 547","author":"Gabidulin","year":"1991"},{"issue":"1","key":"10.1016\/S0166-218X(02)00446-8_BIB6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01390769","article-title":"Severely denting the Gabidulin version of the McEliece public key cryptosystem","volume":"6","author":"Gibson","year":"1995","journal-title":"Designs Codes Cryptography"},{"key":"10.1016\/S0166-218X(02)00446-8_BIB7","unstructured":"J.K. Gibson, Algebraic coded cryptosystems, Ph.D. Thesis, University of London, Royal Holloway, Bedford New College, 1995."},{"key":"10.1016\/S0166-218X(02)00446-8_BIB8","series-title":"Advances in Cryptology\u2014EUROCRYPT\u201996","first-page":"212","article-title":"The security of the Gabidulin public-key cryptosystem","volume":"Vol. 1070","author":"Gibson","year":"1996"},{"key":"10.1016\/S0166-218X(02)00446-8_BIB9","unstructured":"E.A. Krouk, Code based public key cryptosystems, in: V.V. Zyablov (Ed.), Prospective Methods for Telecommunications and Integrated Communication Systems, IPPI, Russian Academy of Sciences, Moscow, 1992, pp. 62\u201369 (in Russian)."},{"key":"10.1016\/S0166-218X(02)00446-8_BIB10","unstructured":"R.J. McEliece, A public key cryptosystem based on algebraic coding theory, JPL DSN Progress Report 42\u201344, Pasadena, CA, 1978, pp. 114\u2013116."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004468?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004468?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T16:23:35Z","timestamp":1553790215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02004468"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00446-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}