{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:24:23Z","timestamp":1775053463778,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5206029","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:09:52Z","timestamp":1251112192000},"page":"1110-1114","source":"Crossref","is-referenced-by-count":27,"title":["On improving security of GPT cryptosystems"],"prefix":"10.1109","author":[{"given":"Ernst M.","family":"Gabidulin","sequence":"first","affiliation":[]},{"given":"Haitham","family":"Rashwan","sequence":"additional","affiliation":[]},{"given":"Bahram","family":"Honary","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","first-page":"237246","article-title":"new technique for decoding codes in the rank metric and its cryptography applications","volume":"38","author":"johansson","year":"2002","journal-title":"Problems Inform Transm"},{"key":"16","year":"0"},{"key":"13","first-page":"1","article-title":"theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inform Transm"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0034349"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9003-9"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9160-8"},{"key":"3","first-page":"17","article-title":"public-key cryptosystems based on linear codes over large alphabets: efficiency and weakness","author":"gabidulin","year":"1995","journal-title":"Codes and Ciphers"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"},{"key":"1","first-page":"114","article-title":"a public key cryptosystem based on algebraic coding theory","author":"mceliece","year":"1978","journal-title":"JPL DSN Progress Report"},{"key":"10","first-page":"5","article-title":"a new brute-force attack for gpt and variants","volume":"3517","author":"overbeck","year":"2005","journal-title":"LNCS"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00446-8"},{"key":"6","year":"0"},{"key":"5","year":"0"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01390769"},{"key":"9","article-title":"high-weight errors in public-key cryptosystems based on reducible rank codes","author":"kshevetskiy","year":"2005","journal-title":"Proc of ISCTA"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820038"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","location":"Seoul, South Korea","start":{"date-parts":[[2009,6,28]]},"end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05206029.pdf?arnumber=5206029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T17:31:11Z","timestamp":1489771871000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5206029\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5206029","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}