{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:02:14Z","timestamp":1761580934256,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642254048"},{"type":"electronic","value":"9783642254055"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25405-5_7","type":"book-chapter","created":{"date-parts":[[2011,11,24]],"date-time":"2011-11-24T06:32:34Z","timestamp":1322116354000},"page":"98-116","source":"Crossref","is-referenced-by-count":28,"title":["An Efficient Attack on All Concrete KKS Proposals"],"prefix":"10.1007","author":[{"given":"Ayoub","family":"Otmani","sequence":"first","affiliation":[]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"7_CR1","doi-asserted-by":"publisher","first-page":"2568","DOI":"10.1109\/TIT.2002.800480","volume":"48","author":"A. Barg","year":"2002","unstructured":"Barg, A., Forney, G.D.: Random codes: Minimum distances and error exponents. IEEE Transactions on Information Theory\u00a048(9), 2568\u20132573 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_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":"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)"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.jss.2010.09.016","volume":"84","author":"P.S.L.M. Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Misoczki, R., Simplicio Jr., M.A.: One-time signature scheme from syndrome decoding over generic error-correcting codes. Journal of Systems and Software\u00a084(2), 198 (2011)","journal-title":"Journal of Systems and Software"},{"key":"7_CR4","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)"},{"key":"7_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-2196-8","volume-title":"Advanced Combinatorics","author":"L. Comtet","year":"1974","unstructured":"Comtet, L.: Advanced Combinatorics. Reidel, Dordrecht (1974)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-73074-3_18","volume-title":"Arithmetic of Finite Fields","author":"P.-L. Cayrel","year":"2007","unstructured":"Cayrel, P.-L., Otmani, A., Vergnaud, D.: On Kabatianskii-Krouk-Smeets Signatures. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 237\u2013251. Springer, Heidelberg (2007)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0012-365X(96)00107-0","volume":"169","author":"D. Caen de","year":"1997","unstructured":"de Caen, D.: A lower bound on the probability of a union. Discrete Mathematics\u00a0169, 217\u2013220 (1997)","journal-title":"Discrete Mathematics"},{"key":"7_CR8","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)"},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1109\/18.556688","volume":"42","author":"I. Dumer","year":"1996","unstructured":"Dumer, I.: Suboptimal decoding of linear codes: partition techniques. IEEE Transactions on Information Theory\u00a042(6), 1971\u20131986 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR10","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. Cryptology ePrint Archive, Report 2010\/331 (2010), \n                  \n                    http:\/\/eprint.iacr.org\/","DOI":"10.1109\/ITW.2011.6089437"},{"key":"7_CR11","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":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BFb0024461","volume-title":"Cryptography and Coding","author":"G. Kabatianskii","year":"1997","unstructured":"Kabatianskii, G., Krouk, E., Smeets, B.: A Digital Signature Scheme Based on Random Error-Correcting Codes. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 161\u2013167. Springer, Heidelberg (1997)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Kabatiansky, G., Krouk, E., Semenov, S.: Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept. John Wiley & Sons (2005)","DOI":"10.1002\/0470867574"},{"key":"7_CR14","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1986","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 5th edn. North\u2013Holland, Amsterdam (1986)","edition":"5"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: Decoding one out of many (preprint, 2011)","DOI":"10.1007\/978-3-642-25405-5_4"},{"key":"7_CR16","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: Wolfmann, J., Cohen, G. (eds.) Coding Theory 1988. LNCS, vol.\u00a0388, pp. 106\u2013113. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25405-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:22:00Z","timestamp":1558297320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25405-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642254048","9783642254055"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25405-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}