{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:40:20Z","timestamp":1765960820294},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319067339"},{"type":"electronic","value":"9783319067346"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06734-6_1","type":"book-chapter","created":{"date-parts":[[2014,5,21]],"date-time":"2014-05-21T00:22:02Z","timestamp":1400631722000},"page":"1-12","source":"Crossref","is-referenced-by-count":32,"title":["New Results for Rank-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Gaborit","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Ruatta","sequence":"additional","affiliation":[]},{"given":"Julien","family":"Schrek","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Z\u00e9mor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Aguilar, C., Gaborit, P., Schrek, J.: A new zero-knowledge code based identification scheme with reduced communication. In: 2011 IEEE Information Theory Workshop (ITW), pp. 648\u2013652 (2011)","DOI":"10.1109\/ITW.2011.6089577"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic, eprint iacr 2013\/400","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding Random Binary Linear Codes in 2 n\/20: How 1 + 1 = 0 Improves Information Set Decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 520\u2013536. Springer, Heidelberg (2012)"},{"key":"1_CR4","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":"Progress in Cryptology \u2013 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":"1_CR5","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. Berger","year":"2004","unstructured":"Berger, T., 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":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BFb0034862","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"F. Chabaud","year":"1996","unstructured":"Chabaud, F., Stern, J.: The Cryptographic Security of the Syndrome in Decoding Problem for Rank Distance Codes. In: Kim, K.-C., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 368\u2013381. Springer, Heidelberg (1996)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/BFb0032363","volume-title":"Cryptography: Policy and Algorithms","author":"K. Chen","year":"1996","unstructured":"Chen, K.: A New Identification Algorithm. In: Dawson, E., Goli\u0107, J. (eds.) Cryptography: Policy and Algorithms 1995. LNCS, vol.\u00a01029, pp. 244\u2013249. Springer, Heidelberg (1996)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"N.T. Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a Mc-Eliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 157\u2013174. Springer, Heidelberg (2001)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-85174-5_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J.-C. Faug\u00e8re","year":"2008","unstructured":"Faug\u00e8re, J.-C., Levy-dit-Vehel, F., Perret, L.: Cryptanalysis of MinRank. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 280\u2013296. Springer, Heidelberg (2008)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., El Din, M.S., Spaenlehauer, P.-J.: Computing loci of rank defects of linear matrices using Grbner bases and applications to cryptology. In: ISSAC 2010, pp. 257\u2013264 (2010)","DOI":"10.1145\/1837934.1837984"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/11779360_24","volume-title":"Coding and Cryptography","author":"C. Faure","year":"2006","unstructured":"Faure, C., Loidreau, P.: A New Public-Key Cryptosystem Based on the Problem of Reconstructing p-Polynomials. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 304\u2013315. Springer, Heidelberg (2006)"},{"key":"1_CR12","unstructured":"Gabidulin, E.M.: Theory of Codes with Maximum Rank Distance. Probl. Peredachi Inf.\u00a0(21), 3\u201316 (1985)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 in Cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 482\u2013489. Springer, Heidelberg (1991)"},{"key":"1_CR14","unstructured":"Gaborit, P., Murat, G., Ruatta, O., Z\u00e9mor, G.: Low Rank Parity Check Codes and their application in cryptography. In: The Preproceedings of Workshop on Coding and Cryptography (WCC) 2013, Borgen, Norway, pp. 167\u2013179 (2013)"},{"key":"1_CR15","unstructured":"Gaborit, P., Ruatta, O., Schrek, J., Z\u00e9mor, G.: RankSign: An efficient signature algorithm based on the rank metric. eprint iacr (submitted)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-25405-5_3","volume-title":"Post-Quantum Cryptography","author":"P. Gaborit","year":"2011","unstructured":"Gaborit, P., Schrek, J., Z\u00e9mor, G.: Full Cryptanalysis of the Chen Identification Protocol. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol.\u00a07071, pp. 35\u201350. Springer, Heidelberg (2011)"},{"key":"1_CR17","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. eprint. Submitted to IEEE Trans. Information Theory"},{"key":"1_CR18","unstructured":"von zur Gathen, J., Gerhard, J.: Modern computer algebra. Cambridge University Press (2003)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A Ring-Based Public Key Cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"1_CR20","unstructured":"Levy-dit-Vehel, F., Perret, L.: Algebraic decoding of rank metric codes. In: Proceedings of YACC 2006 (2006)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-12929-2_11","volume-title":"Post-Quantum Cryptography","author":"P. Loidreau","year":"2010","unstructured":"Loidreau, P.: Designing a Rank Metric Based McEliece Cryptosystem. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 142\u2013152. Springer, Heidelberg (2010)"},{"key":"1_CR22","unstructured":"Loidreau, P.: Properties of codes in rank metric, \n                  \n                    http:\/\/arxiv.org\/abs\/cs\/0610057"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.-P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: New McEliece Variants from Moderate Density Parity-Check Codes. Cryptology ePrint Archive: Report 2012\/409","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Ore, O.: On a special class of polynomials. Trans. American Math. Soc. (1933)","DOI":"10.2307\/1989849"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Ourivski, A.V., Johansson, T.: New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications. Probl. Inf. Transm.\u00a0(38), 237\u2013246 (2002)","DOI":"10.1023\/A:1020369320078"},{"issue":"2","key":"1_CR26","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. J. Cryptology\u00a021(2), 280\u2013301 (2008)","journal-title":"J. Cryptology"},{"issue":"6","key":"1_CR27","doi-asserted-by":"publisher","first-page":"2757","DOI":"10.1109\/18.556672","volume":"42","author":"J. Stern","year":"1996","unstructured":"Stern, J.: A new paradigm for public key identification. IEEE Transactions on Information Theory\u00a042(6), 2757\u20132768 (1996)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06734-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T17:32:12Z","timestamp":1558891932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06734-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319067339","9783319067346"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06734-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}