{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:45Z","timestamp":1772283585291,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642129285","type":"print"},{"value":"9783642129292","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12929-2_11","type":"book-chapter","created":{"date-parts":[[2010,5,31]],"date-time":"2010-05-31T05:17:53Z","timestamp":1275283073000},"page":"142-152","source":"Crossref","is-referenced-by-count":28,"title":["Designing a Rank Metric Based McEliece Cryptosystem"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Loidreau","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","first-page":"649","volume-title":"Handbook of Coding Theory, ch. 7","author":"A. Barg","year":"1998","unstructured":"Barg, A.: Handbook of Coding Theory, ch. 7, vol.\u00a01, pp. 649\u2013754. North-Holland, Amsterdam (1998)"},{"issue":"11","key":"11_CR2","doi-asserted-by":"publisher","first-page":"3016","DOI":"10.1109\/TIT.2003.819322","volume":"49","author":"T.P. Berger","year":"2003","unstructured":"Berger, T.P.: Isometries for rank distance and permutation group of Gabidulin codes. IEEE Transactions on Information Theory\u00a049(11), 3016\u20133019 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"AFRICACRYPT 2009","author":"T.P. Berger","year":"2009","unstructured":"Berger, T.P., Cayrel, P.L., Gaborit, P., Otmani, A.: Reducing key-length of the McEliece cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol.\u00a05580, pp. 77\u201397. Springer, Heidelberg (2009)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-30556-9_18","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"T.P. Berger","year":"2004","unstructured":"Berger, T.P., Loidreau, P.: Designing an efficient and secure public-key cryptosystem based on reducible rank codes. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol.\u00a03348, pp. 218\u2013229. Springer, Heidelberg (2004)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"T.P. Berger","year":"2005","unstructured":"Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Designs, Codes and Cryptography\u00a035, 63\u201379 (2005)","journal-title":"Designs, Codes and Cryptography"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory\u00a024(3) (May 1978)","DOI":"10.1109\/TIT.1978.1055873"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A. Canteaut","year":"1998","unstructured":"Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: Application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Transactions on Information Theory\u00a044(1), 367\u2013378 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","first-page":"151","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"N. Courtois","year":"2001","unstructured":"Courtois, N., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 151\u2013174. Springer, Heidelberg (2001)"},{"key":"11_CR9","first-page":"1","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximal rank distance. Problems of Information Transmission\u00a021, 1\u201312 (1985)","journal-title":"Problems of Information Transmission"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0034349","volume-title":"Algebraic coding","author":"E.M. Gabidulin","year":"1991","unstructured":"Gabidulin, E.M.: A fast matrix decoding algorithm for rank-error correcting codes. In: Cohen, G., Litsyn, S., Lobstein, A., Z\u00e9mor, G. (eds.) Algebraic Coding 1991. LNCS, vol.\u00a0573, pp. 126\u2013133. Springer, Heidelberg (1991)"},{"key":"11_CR11","unstructured":"Gabidulin, E.M.: Public-key cryptosystems based on linear codes over large alphabets: efficiency and weakness. In: Farrell, P.G. (ed.) Codes and Cyphers, Formara Limited, Southend-on-sea, Essex, pp. 17\u201331 (1995)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Gabidulin, E.M., Ourivski, A.V.: Modified GPT PKC with right scrambler. In: Augot, D., Carlet, C. (eds.) Proceedings of the 2nd International workshop on Coding and Cryptography, WCC 2001, pp. 233\u2013242 (2001), ISBN Number: 2-761-1179-3","DOI":"10.1016\/S1571-0653(04)00168-4"},{"key":"11_CR13","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 application in cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 482\u2013489. Springer, Heidelberg (1991)"},{"key":"11_CR14","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: Proceedings of WCC 2005 (2005)"},{"key":"11_CR15","doi-asserted-by":"publisher","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. Designs, Codes and Cryptography\u00a06, 37\u201345 (1995)","journal-title":"Designs, Codes and Cryptography"},{"key":"11_CR16","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":"J.K. Gibson","year":"1996","unstructured":"Gibson, J.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":"12","key":"11_CR17","doi-asserted-by":"publisher","first-page":"3160","DOI":"10.1109\/TIT.2003.820016","volume":"49","author":"K. Kobara","year":"2003","unstructured":"Kobara, K., Imai, H.: On the one-wayness against chosen-plaintext attacks of the Loidreau\u2019s modified McEliece PKC. IEEE Transactions on Information Theory\u00a049(12), 3160\u20133168 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/3-540-44448-3_45","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"P. Loidreau","year":"2000","unstructured":"Loidreau, P.: Strengthening McEliece public-key cryptosystem. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, p. 585. Springer, Heidelberg (2000)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11779360_4","volume-title":"Coding and Cryptography","author":"P. Loidreau","year":"2006","unstructured":"Loidreau, P.: A Welch-Berlekamp like algorithm for decoding Gabidulin codes. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 36\u201345. Springer, Heidelberg (2006)"},{"key":"11_CR20","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Technical report, Jet Propulsion Lab. DSN Progress Report (1978)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","volume-title":"Selected areas in cryptography, 16th International Workshop, SAC 2009","author":"R. Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.: Compact McEliece keys from goppa codes. In: Rijmen, V. (ed.) SAC 2009. LNCS, vol.\u00a05867, pp. 376\u2013392. Springer, Heidelberg (2009)"},{"issue":"2","key":"11_CR22","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory\u00a015(2), 159\u2013166 (1986)","journal-title":"Problems of Control and Information Theory"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Otmani, A., Tillich, J.P., Dallot, L.: Cryptanalysis of two mceliece cryptosystems based on quasi-cyclic codes. Mathematics in Computer Science (to appear)","DOI":"10.1007\/s11786-009-0015-8"},{"key":"11_CR24","unstructured":"Ourivski, A.V.: Recovering a parent code for subcodes of maximal rank distance codes. In: Augot, D., Charpin, P., Kabatianski, G. (eds.) Proceedings of the 3rd International workshop on Coding and Cryptography, WCC 2003, pp. 357\u2013363 (2003), ISBN Number: 2-7261-1205-6"},{"issue":"1","key":"11_CR25","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.: Column scrambler for the GPT cryptosystem. Discrete Applied Mathematics\u00a0128(1), 207\u2013221 (2003); Special issue of the second International Workshop on Coding and Cryptography (WCC 2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"12","key":"11_CR26","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1109\/TIT.2003.820038","volume":"49","author":"A.V. Ourivski","year":"2003","unstructured":"Ourivski, A.V., Gabidulin, E.M., 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"},{"issue":"3","key":"11_CR27","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"A.V. Ourivski","year":"2002","unstructured":"Ourivski, A.V., Johannson, T.: 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":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11554868_5","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"R. Overbeck","year":"2005","unstructured":"Overbeck, R.: A new structural attack for GPT and variants. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 50\u201363. Springer, Heidelberg (2005)"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11779360_15","volume-title":"Coding and Cryptography","author":"R. Overbeck","year":"2006","unstructured":"Overbeck, R.: Extending Gibson\u2019s attacks on the GPT cryptosystem. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 178\u2013188. Springer, Heidelberg (2006)"},{"issue":"2","key":"11_CR30","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R. Overbeck","year":"2008","unstructured":"Overbeck, R.: Structural attacks for public-key cryptosystems based on gabidulin codes. Journal of Cryptology\u00a021(2), 280\u2013301 (2008)","journal-title":"Journal of Cryptology"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Richter, G., Plass, S.: Fast decoding of rank-codes with rank errors and column erasures. In: 2004 IEEE International Symposium on Information Theory, ISIT 2004 (2004)","DOI":"10.1109\/ISIT.2004.1365435"},{"issue":"2","key":"11_CR32","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"R.M. Roth","year":"1991","unstructured":"Roth, R.M.: Maximum-Rank array codes and their application to crisscross error correction. IEEE Transactions on Information Theory\u00a037(2), 328\u2013336 (1991)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR33","unstructured":"Sendrier, N.: Cryptosyst\u00e8mes \u00e0 cl\u00e9 publique bas\u00e9s sur les codes correcteurs d\u2019erreurs (2001)"},{"issue":"6","key":"11_CR34","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A. Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Transactions on Information Theory\u00a043(6), 1757\u20131766 (1997)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12929-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:48:58Z","timestamp":1619783338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12929-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129285","9783642129292"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12929-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}