{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:45:37Z","timestamp":1725936337904},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_36","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T04:35:54Z","timestamp":1513744554000},"page":"454-459","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Code-Based Key Encapsulation from McEliece\u2019s Cryptosystem"],"prefix":"10.1007","author":[{"given":"Edoardo","family":"Persichetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"36_CR1","unstructured":"National Institute of Standards and Technology: Call for proposals, December 2016. http:\/\/csrc.nist.gov\/groups\/ST\/post-quantum-crypto\/documents\/call-for-proposals-final-dec-2016.pdf"},{"issue":"3","key":"36_CR2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-40349-1_15","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"DJ Bernstein","year":"2013","unstructured":"Bernstein, D.J., Chou, T., Schwabe, P.: McBits: fast constant-time code-based cryptography. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 250\u2013272. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_15"},{"key":"36_CR4","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: http:\/\/keccak.noekeon.org\/"},{"issue":"1","key":"36_CR5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R Cramer","year":"2004","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput. 33(1), 167\u2013226 (2004)","journal-title":"SIAM J. Comput."},{"key":"36_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge (1963)"},{"key":"36_CR7","unstructured":"McEliece, R.: A public-key cryptosystem based on algebraic coding theory. Technical report, NASA (1978)"},{"key":"36_CR8","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 (2012)","DOI":"10.1109\/ISIT.2013.6620590"},{"issue":"2","key":"36_CR9","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Probl. Control Inf. Theory"},{"issue":"2","key":"36_CR10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N Patterson","year":"1975","unstructured":"Patterson, N.: The algebraic decoding of Goppa codes. IEEE Trans. Inf. Theory 21(2), 203\u2013207 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-38616-9_12","volume-title":"Post-Quantum Cryptography","author":"E Persichetti","year":"2013","unstructured":"Persichetti, E.: Secure and anonymous hybrid encryption from coding theory. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 174\u2013187. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_12"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: The tightness of security reductions in code-based cryptography. In: IEEE Information Theory Workshop (ITW), pp. 415\u2013419, October 2011","DOI":"10.1109\/ITW.2011.6089492"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T11:32:28Z","timestamp":1603539148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}