{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:02:18Z","timestamp":1726038138691},"publisher-location":"Cham","reference-count":14,"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_1","type":"book-chapter","created":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T15:02:23Z","timestamp":1563634943000},"page":"1-10","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Resistant Public Key Encryption Scheme HermitianRLCE"],"prefix":"10.1007","author":[{"given":"Gretchen L.","family":"Matthews","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongge","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","volume-title":"Security and Cryptography for Networks","author":"M Baldi","year":"2008","unstructured":"Baldi, M., Bodrato, M., Chiaraluce, F.: A new analysis of the McEliece cryptosystem based on QC-LDPC codes. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 246\u2013262. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-85855-3_17"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Couvreur, A., Lequesne, M., Tillich, J.-P.: Recovering short secret keys of RLCE in polynomial time. arXiv preprint \n                    arXiv:1805.11489\n                    \n                   (2018)","DOI":"10.1007\/978-3-030-25510-7_8"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-55220-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., Otmani, A., Tillich, J.P.: Polynomial time attack on wild McEliece over quadratic extensions. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 17\u201339. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-642-55220-5_2"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Couvreur, A., M\u00e1rquez-Corbella, I., Pellikaan, R.: A polynomial time attack against algebraic geometry code based public key cryptosystems. In: 2014 IEEE International Symposium on Information Theory (ISIT), pp. 1446\u20131450. IEEE (2014)","DOI":"10.1109\/ISIT.2014.6875072"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-29360-8_3","volume-title":"Post-Quantum Cryptography","author":"M Grassl","year":"2016","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., Steinwandt, R.: Applying Grover\u2019s algorithm to AES: quantum resource estimates. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 29\u201343. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-29360-8_3"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"H Janwa","year":"1996","unstructured":"Janwa, H., Moreno, O.: Mceliece public key cryptosystems using algebraic-geometric codes. Des., Codes Cryptogr. 8(3), 293\u2013307 (1996)","journal-title":"Des., Codes Cryptogr."},{"issue":"7","key":"1_CR7","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1007\/s11128-015-0993-1","volume":"14","author":"S Kepley","year":"2015","unstructured":"Kepley, S., Steinwandt, R.: Quantum circuits for \n                    \n                      \n                    \n                    $${F}_{2^m}$$\n                  -multiplication with subquadratic gate count. Quantum Inf. Process. 14(7), 2373\u20132386 (2015)","journal-title":"Quantum Inf. Process."},{"issue":"44","key":"1_CR8","first-page":"114","volume":"42","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42(44), 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.-P., Sendrier, N., Barreto, P.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: Proceedings of IEEE ISIT 2013, pp. 2069\u20132073 (2013)","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","volume-title":"Post-Quantum Cryptography","author":"C Peters","year":"2010","unstructured":"Peters, C.: Information-set decoding for linear codes over F\n                    \n                      \n                    \n                    $$_{q}$$\n                  . In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 81\u201394. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-12929-2_7"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J Stern","year":"1989","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1989). \n                    https:\/\/doi.org\/10.1007\/BFb0019850"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Wang, Y.: Quantum resistant random linear code based public key encryption scheme RLCE. In: Proceedings of IEEE ISIT, pp. 2519\u20132523, July 2016","DOI":"10.1109\/ISIT.2016.7541753"},{"key":"1_CR13","unstructured":"Wang, Y.: Revised quantum resistant public key encryption scheme RLCE and IND-CCA2 security for McEliece schemes. IACR ePrint, July 2017. \n                    https:\/\/eprint.iacr.org\/2017\/206.pdf"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BFb0087995","volume-title":"Coding Theory and Algebraic Geometry","author":"K Yang","year":"1992","unstructured":"Yang, K., Kumar, P.V.: On the true minimum distance of Hermitian codes. In: Stichtenoth, H., Tsfasman, M.A. (eds.) Coding Theory and Algebraic Geometry, pp. 99\u2013107. Springer, Heidelberg (1992). \n                    https:\/\/doi.org\/10.1007\/BFb0087995"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T15:02:29Z","timestamp":1563634949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25922-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030259211","9783030259228"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25922-8_1","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"}}]}}