{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:35:20Z","timestamp":1725708920007},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642349300"},{"type":"electronic","value":"9783642349317"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34931-7_27","type":"book-chapter","created":{"date-parts":[[2012,12,5]],"date-time":"2012-12-05T22:24:04Z","timestamp":1354746244000},"page":"474-488","source":"Crossref","is-referenced-by-count":14,"title":["Implementing CFS"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Landais","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Sendrier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","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 McEliece-Based Digital Signature Scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 157\u2013174. Springer, Heidelberg (2001)"},{"unstructured":"McEliece, R.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol., Pasadena, CA, 114\u2013116 (January 1978)","key":"27_CR2"},{"unstructured":"Beuchat, J.L., Sendrier, N., Tisserand, A., Villard, G.: FPGA implementation of a recently published signature scheme. Rapport de recherche 5158, INRIA (2004)","key":"27_CR3"},{"doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C., Gauthier, V., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high rate McEliece cryptosystems. In: ITW 2011, Paraty, Brazil, pp. 282\u2013286 (October 2011)","key":"27_CR4","DOI":"10.1109\/ITW.2011.6089437"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-19574-7_11","volume-title":"Selected Areas in Cryptography","author":"M. Finiasz","year":"2011","unstructured":"Finiasz, M.: Parallel-CFS: Strengthening the CFS McEliece-Based Signature Scheme. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 159\u2013170. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory\u00a024(3) (May 1978)","key":"27_CR6","DOI":"10.1109\/TIT.1978.1055873"},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"S5","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 Transactions\u00a0IT-8, S5\u2013S9 (1962)","journal-title":"IRE Transactions IT-"},{"key":"27_CR8","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.\u00a0388, pp. 106\u2013113. Springer, Heidelberg (1989)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"D.J. 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.\u00a06841, pp. 743\u2013760. Springer, Heidelberg (2011)"},{"key":"27_CR10","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":"ASIACRYPT 2011","author":"A. May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding Random Linear Codes in \n                    \n                      \n                    \n                    $\\tilde{\\mathcal{O}}(2^{0.054n})$\n                  . In: Lee, D., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 107\u2013124. Springer, Heidelberg (2011)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"D. Wagner","year":"2002","unstructured":"Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 288\u2013303. Springer, Heidelberg (2002)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-46416-6_3","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"P. Camion","year":"1991","unstructured":"Camion, P., Patarin, J.: The Knapsack Hash Function Proposed at Crypto 1989 Can Be Broken. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 39\u201353. Springer, Heidelberg (1991)"},{"unstructured":"Coron, J.S., Joux, A.: Cryptanalysis of a provably secure cryptographic hash function. Cryptology ePrint Archive, Report 2004\/013 (2004), \n                    \n                      http:\/\/eprint.iacr.org\/","key":"27_CR13"},{"doi-asserted-by":"crossref","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography. In: Bernstein, D., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 95\u2013145. Springer (2009)","key":"27_CR14","DOI":"10.1007\/978-3-540-88702-7_4"},{"issue":"10","key":"27_CR15","doi-asserted-by":"publisher","first-page":"2669","DOI":"10.1109\/TIT.2002.802608","volume":"48","author":"T. Johansson","year":"2002","unstructured":"Johansson, T., J\u00f6nsson, F.: On the complexity of some cryptographic problems based on the general decoding problem. IEEE-IT\u00a048(10), 2669\u20132678 (2002)","journal-title":"IEEE-IT"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-25405-5_4","volume-title":"Post-Quantum Cryptography","author":"N. Sendrier","year":"2011","unstructured":"Sendrier, N.: Decoding One Out of Many. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol.\u00a07071, pp. 51\u201367. Springer, Heidelberg (2011)"},{"unstructured":"Dumer, I.: On minimum distance decoding of linear codes. In: Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, Moscow, pp. 50\u201352 (1991)","key":"27_CR17"},{"key":"27_CR18","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.\u00a05912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"27_CR19","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\/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)"},{"issue":"2","key":"27_CR20","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a021(2), 203\u2013207 (1975)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J. Massey","year":"1969","unstructured":"Massey, J.: Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory\u00a015(1), 122\u2013127 (1969)","journal-title":"IEEE Transactions on Information Theory"},{"unstructured":"Berlekamp, E.: Algebraic Coding Theory. Aegen Park Press (1968)","key":"27_CR22"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34931-7_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:07:54Z","timestamp":1620133674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34931-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642349300","9783642349317"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34931-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}