{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T15:15:34Z","timestamp":1767971734711,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540289388","type":"print"},{"value":"9783540320661","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11554868_5","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:49:02Z","timestamp":1127832542000},"page":"50-63","source":"Crossref","is-referenced-by-count":48,"title":["A New Structural Attack for GPT and Variants"],"prefix":"10.1007","author":[{"given":"Raphael","family":"Overbeck","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Designs, Codes and Cryptography\u00a035(1) (2005)","DOI":"10.1007\/s10623-003-6151-2"},{"key":"5_CR2","volume-title":"IEEE International Symposium on Information Theory","author":"T.P. Berger","year":"2002","unstructured":"Berger, T.P., Loidreau, P.: Security of the Niederreiter form of the GPT public-key cryptosystem. In: IEEE International Symposium on Information Theory, Lausanne, Suisse. IEEE, Los Alamitos (2002)"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0166-218X(02)00446-8","volume":"128","author":"E.M. Gabidulin","year":"2003","unstructured":"Gabidulin, E.M., Ourivski, A.V.: Column scrambler for the GPT cryptosystem. Discrete Applied Mathematics\u00a0128(1), 207\u2013221 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR4","unstructured":"Gabidulin, E.M.: On public-key cryptosystems based on linear codes. In: Proc. of 4th IMA Conference on Cryptography and Coding 1993, Codes and Ciphers. IMA Press (1995)"},{"key":"5_CR5","unstructured":"Gabidulin, E.M., Loidreau, P.: Subfield subcodes of maximum-rank distance codes. In: Seventh International Workshop on Algebraic and Combinatorial Coding Theory. ACCT, vol.\u00a07, pp. 151\u2013156 (2000)"},{"issue":"12","key":"5_CR6","doi-asserted-by":"publisher","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.: Reducible rank codes and their applications to cryptography. IEEE Transactions on Information Theory\u00a049(12), 3289\u20133293 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"E.M. Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their applications to cryptography. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 482\u2013489. Springer, Heidelberg (1991)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/3-540-68339-9_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"K. Gibson","year":"1996","unstructured":"Gibson, K.: The security of the Gabidulin public key cryptosystem. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 212\u2013223. Springer, Heidelberg (1996)"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"T. Johansson","year":"2002","unstructured":"Johansson, T., Ourivski, A.V.: New technique for decoding codes in the rank metric and its cryptography applications. Problems of Information Transmission\u00a038(3), 237\u2013246 (2002)","journal-title":"Problems of Information Transmission"},{"key":"5_CR10","unstructured":"Ourivski, A.V.: Recovering a parent code for subcodes of maximal rank distance codes. In: Proc. of WCC 2003, pp. 357\u2013363 (2003)"},{"key":"5_CR11","unstructured":"Overbeck, R.: Extending Gibson\u2019s attacks on the GPT cryptosystem. In: Proc. of WCC 2005, pp. 382\u2013391 (2005)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 Mycrypt 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11554868_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:07:07Z","timestamp":1619507227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11554868_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540289388","9783540320661"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11554868_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}