{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:48:34Z","timestamp":1757310514226},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319293592"},{"type":"electronic","value":"9783319293608"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29360-8_8","type":"book-chapter","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T10:46:23Z","timestamp":1454496383000},"page":"104-117","source":"Crossref","is-referenced-by-count":9,"title":["Vulnerabilities of \u201cMcEliece in the World of Escher\u201d"],"prefix":"10.1007","author":[{"given":"Dustin","family":"Moody","sequence":"first","affiliation":[]},{"given":"Ray","family":"Perlner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,4]]},"reference":[{"key":"8_CR1","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                    \n                      \n                    \n                    $$^{n\/20}$$\n                  : how 1 + 1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 743\u2013760. Springer, Heidelberg (2011)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"8_CR4","unstructured":"Gligoroski, D.: A new code based public key encryption and signature scheme based on list decoding. Presented at Workshop on Cybersecurity in a Post-Quantum World, NIST, Gaithersburg MD, USA (2015)"},{"key":"8_CR5","unstructured":"Gaborit, P., Murat, G., Ruatta, O., Zemor, G.: Low rank parity check codes and their application to cryptography. In: Parker, M.G., Budaghyan, L., Helleseth, T. (eds.) The International Workshop on Coding and Cryptography (WCC 2013), Bergen, Norway, p. 13, April 2013. ISBN: 978-82-308-2269-2"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-319-11659-4_6","volume-title":"Post-Quantum Cryptography","author":"P Gaborit","year":"2014","unstructured":"Gaborit, P., Ruatta, O., Schrek, J., Z\u00e9mor, G.: RankSign: an efficient signature algorithm based on the rank metric. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 88\u2013107. Springer, Heidelberg (2014)"},{"key":"8_CR7","unstructured":"Gligoroski, D., Samardjiska, S., Jacobsen, H., Bezzateev, S.: McEliece in the World of Escher. Cryptology ePrint Archive, Report 2014\/360 (2014). \n                    http:\/\/eprint.iacr.org\/"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45961-8_25","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"PJ Lee","year":"1988","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: Barstow, D., et al. (eds.) EUROCRYPT 1988. LNCS, vol. 330, pp. 275\u2013280. Springer, Heidelberg (1988)"},{"issue":"5","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"J Leon","year":"1988","unstructured":"Leon, J.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inf. Theory 34(5), 1354\u20131359 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-38616-9_7","volume-title":"Post-Quantum Cryptography","author":"G Landais","year":"2013","unstructured":"Landais, G., Tillich, J.-P.: An efficient attack of a McEliece cryptosystem variant based on convolutional codes. In: Gaborit, Philippe (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 102\u2013117. Springer, Heidelberg (2013)"},{"key":"8_CR11","unstructured":"McEliece, R.J.: A Public-Key Cryptosystem Based On Algebraic Coding Theory. Deep Space Network Progress Report 44, pp. 114\u2013116 (1978)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in \n                    \n                      \n                    \n                    $$\\tilde{\\cal O}(2^{0.054n})$$\n                  . In: Lee, D.H., Wang, Xiaoyun (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107\u2013124. Springer, Heidelberg (2011)"},{"key":"8_CR13","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). \n                    http:\/\/eprint.iacr.org\/"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-25405-5_7","volume-title":"Post-Quantum Cryptography","author":"A Otmani","year":"2011","unstructured":"Otmani, A., Tillich, J.-P.: An efficient attack on all concrete KKS proposals. In: Yang, Bo-Yin (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 98\u2013116. Springer, Heidelberg (2011)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-319-11659-4_13","volume-title":"Post-Quantum Cryptography","author":"R Perlner","year":"2014","unstructured":"Perlner, R.: Optimizing information set decoding algorithms to attack cyclosymmetric MDPC codes. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 220\u2013228. Springer, Heidelberg (2014)"},{"issue":"5","key":"8_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Tran. Inf. Theory 8(5), 5\u20139 (1962)","journal-title":"IRE Tran. Inf. Theory"},{"key":"8_CR17","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 and Applications. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29360-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T12:53:26Z","timestamp":1559393606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29360-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319293592","9783319293608"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29360-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}