{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:02:25Z","timestamp":1726038145357},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030259211"},{"type":"electronic","value":"9783030259228"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25922-8_6","type":"book-chapter","created":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T15:02:23Z","timestamp":1563634943000},"page":"102-114","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Weak Keys in the Faure\u2013Loidreau Cryptosystem"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Jerkovits","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannes","family":"Bartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"5","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"6_CR3","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. 6061, pp. 142\u2013152. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-12929-2_11"},{"key":"6_CR4","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic codes. Deep Space Network Progress Report 44, pp. 114\u2013116 (1978)"},{"key":"6_CR5","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\u2013polynomials. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol. 3969, pp. 304\u2013315. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/11779360_24"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-39200-9_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Augot","year":"2003","unstructured":"Augot, D., Finiasz, M.: A public key encryption scheme based on the polynomial reconstruction problem. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 229\u2013240. Springer, Heidelberg (2003). \n                    https:\/\/doi.org\/10.1007\/3-540-39200-9_14"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Wachter-Zeh, A., Puchinger, S., Renner, J.: Repairing the Faure-Loidreau public-key cryptosystem. In: IEEE International Symposium on Information Theory (ISIT) (2018)","DOI":"10.1109\/ISIT.2018.8437561"},{"issue":"7","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1007\/s10623-017-0402-0","volume":"86","author":"P Gaborit","year":"2018","unstructured":"Gaborit, P., Otmani, A., Kalachi, H.T.: Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes. Des. Codes Crypt. 86(7), 1391\u20131403 (2018)","journal-title":"Des. Codes Crypt."},{"key":"6_CR9","unstructured":"Loidreau, P., Overbeck, R.: Decoding rank errors beyond the error correcting capability. In: International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), pp. 186\u2013190, September 2006"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TIT.1966.1053873","volume":"12","author":"G Forney","year":"1966","unstructured":"Forney, G.: Generalized minimum distance decoding. IEEE Trans. Inf. Theory 12(2), 125\u2013131 (1966)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR11","unstructured":"Bossert, M., Costa, E., Gabidulin, E., Schulz, E., Weckerle, M.: Verfahren und Kommunikationsvorrichtung zum Dekodieren von mit einem Rang-Code codierten Daten, EU Patent EP20 040 104 458 (2003)"},{"issue":"1","key":"6_CR12","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985)","journal-title":"Problemy Peredachi Informatsii"},{"key":"6_CR13","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Rank errors and rank erasures correction. In: 4th International Colloquium on Coding Theory (1991)"},{"key":"6_CR14","unstructured":"Richter, G., Plass, S.: Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm. In: International ITG Conference on Systems, Communications and Coding (SCC) (2004)"},{"issue":"1\u20133","key":"6_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10623-008-9185-7","volume":"49","author":"EM Gabidulin","year":"2008","unstructured":"Gabidulin, E.M., Pilipchuk, N.I.: Error and erasure correcting algorithms for rank codes. Des. Codes Crypt. 49(1\u20133), 105\u2013122 (2008)","journal-title":"Des. Codes Crypt."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Silva, D.: Error control for network coding, Ph.D. dissertation (2009)","DOI":"10.1109\/CWIT.2009.5069508"},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TIT.2010.2096032","volume":"57","author":"V Sidorenko","year":"2011","unstructured":"Sidorenko, V., Jiang, L., Bossert, M.: Skew-feedback shift-register synthesis and decoding interleaved Gabidulin codes. IEEE Trans. Inf. Theory 57(2), 621\u2013632 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s10623-014-9953-5","volume":"73","author":"A Wachter-Zeh","year":"2014","unstructured":"Wachter-Zeh, A., Zeh, A.: List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques. Des. Codes Crypt. 73(2), 547\u2013570 (2014). \n                    https:\/\/doi.org\/10.1007\/s10623-014-9953-5","journal-title":"Des. Codes Crypt."}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25922-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T15:03:24Z","timestamp":1563635004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25922-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030259211","9783030259228"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25922-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Darmstadt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cbc2019.dii.univpm.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}