{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T06:25:23Z","timestamp":1766298323865},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T00:00:00Z","timestamp":1352246400000},"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":[[2014,1]]},"DOI":"10.1007\/s10623-012-9757-4","type":"journal-article","created":{"date-parts":[[2012,11,6]],"date-time":"2012-11-06T14:55:33Z","timestamp":1352213733000},"page":"231-239","source":"Crossref","is-referenced-by-count":4,"title":["Modified Niederreiter type of GPT cryptosystem based on reducible rank codes"],"prefix":"10.1007","volume":"70","author":[{"given":"Eraj","family":"Khan","sequence":"first","affiliation":[]},{"given":"Ernst","family":"Gabidulin","sequence":"additional","affiliation":[]},{"given":"Bahram","family":"Honary","sequence":"additional","affiliation":[]},{"given":"Hassan","family":"Ahmed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,7]]},"reference":[{"key":"9757_CR1","first-page":"114","volume":"42\u201344","author":"R.J. McEliece","year":"1978","unstructured":"McEliece R.J.: A public key cryptosystem based on algebraic coding theory. JPL DSN Prog. Rep. 42\u201344, 114\u2013116 (1978)","journal-title":"JPL DSN Prog. Rep."},{"key":"9757_CR2","first-page":"19","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter H.: Knapsack-type cryptosystem and algebraic coding theory. Probl. Control Inf. Theory, 15, 19\u201334 (1986)","journal-title":"Probl. Control Inf. Theory."},{"key":"9757_CR3","first-page":"1","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 21, 1\u201312 (1985)","journal-title":"Probl. Inf. Transm."},{"key":"9757_CR4","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, Berlin (1991)."},{"key":"9757_CR5","unstructured":"Gabidulin E.M.: Public-key cryptosystems based on linear codes over large alphabets: efficiency and weakness. In: Farrell P.G.(ed.) Codes and Ciphers, pp. 17\u201332. Formara Limited, Essex (1995)."},{"key":"9757_CR6","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.: Reducible rank codes and their applications to cryptography. IEEE Trans. Inf. Theory. 49, 3289\u20133293 (2003)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"9757_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"J.K. Gibson","year":"1995","unstructured":"Gibson J.K.: Severely denting the Gabidulin version of the McEliece public key cryptosystem. Des. Codes Cryptogr. 6, 37\u201345 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"9757_CR8","unstructured":"Gibson J.K.: The security of the Gabidulin public-key cryptosystem. In: Maurer U.M. (ed.) Advances in Cryptology\u2014EUROCRYPT\u201996, LNCS vol. 1070, pp. 212\u2013223. Springer, Berlin (1996)."},{"key":"9757_CR9","unstructured":"Overbeck R.: A new brute-force attack for GPT and variants. In: Dawson, Ed., Vaudenay, S. (eds) Proceedings of Mycrypt 2005, vol. 3715 of LNCS, pp. 50\u201363. Springer Berlin\/Heidelberg (2005)."},{"issue":"2","key":"9757_CR10","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R. Overbeck","year":"2008","unstructured":"Overbeck R.: Brute-force attacks public key cryptosystem based on Gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2008)","journal-title":"J. Cryptol."},{"key":"9757_CR11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10623-007-9160-8","volume":"48","author":"E.M Gabidulin","year":"2008","unstructured":"Gabidulin E.M: Attacks and counter-attacks on the GPT public key cryptosystem. Des. Codes Cryptogr. 48, 171\u2013177 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"9757_CR12","doi-asserted-by":"crossref","unstructured":"Gabidulin E.M., Rashwan H., Honary B.: On improving security of GPT cryptosystems. In: IEEE International Symposium Information Theory (ISIT 2009), pp. 1110\u20131114 (2009).","DOI":"10.1109\/ISIT.2009.5206029"},{"key":"9757_CR13","doi-asserted-by":"crossref","unstructured":"Rashwan H., Gabidulin E., Honary B.: A smart approach for GPT cryptosystem based on rank codes. In: IEEE International Symposium Information Theory (ISIT 2010), pp. 2463\u20132467 (2010).","DOI":"10.1109\/ISIT.2010.5513549"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9757-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9757-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9757-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:35Z","timestamp":1559246315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9757-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,7]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9757"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9757-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,7]]}}}