{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:22:50Z","timestamp":1759332170874},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215179"},{"type":"electronic","value":"9783642215186"}],"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-21518-6_23","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T11:34:59Z","timestamp":1310988899000},"page":"336-349","source":"Crossref","is-referenced-by-count":13,"title":["Quasi-Dyadic CFS Signatures"],"prefix":"10.1007","author":[{"given":"Paulo S. L. M.","family":"Barreto","sequence":"first","affiliation":[]},{"given":"Pierre-Louis","family":"Cayrel","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Misoczki","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Niebuhr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"T.P. Berger","year":"2009","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the mcEliece cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol.\u00a05580, pp. 77\u201397. Springer, Heidelberg (2009)"},{"key":"23_CR2","unstructured":"Bernstein, D.J.: List decoding for binary Goppa codes. Preprint (2008), http:\/\/cr.yp.to\/papers.html#goppalist"},{"key":"23_CR3","unstructured":"Cayrel, P.-L., Gaborit, P., Galindo, D., Girault, M.: Improved identity-based identification using correcting codes. CoRR, abs\/0903.0069 (2009)"},{"key":"23_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":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-88353-1_6","volume-title":"Research in Cryptology","author":"L. Dallot","year":"2008","unstructured":"Dallot, L.: Towards a concrete security proof of courtois, finiasz and sendrier signature scheme. In: Lucks, S., Sadeghi, A.-R., Wolf, C. (eds.) WEWoRC 2007. LNCS, vol.\u00a04945, pp. 65\u201377. Springer, Heidelberg (2008), http:\/\/users.info.unicaen.fr\/~ldallot\/download\/articles\/CFSProof-dallot.pdf"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Dallot, L., Vergnaud, D.: Provably secure code-based threshold ring signatures. In: Parker, M.G. (ed.) CC 2009. LNCS, vol.\u00a05921, pp. 222\u2013235. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-10868-6_13"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J.-C. Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of mcEliece variants with compact keys. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 279\u2013298. Springer, Heidelberg (2010)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: A distinguisher for high rate mceliece cryptosystems. Cryptology ePrint Archive, Report 2010\/331 (2010), http:\/\/eprint.iacr.org\/","DOI":"10.1109\/ITW.2011.6089437"},{"key":"23_CR9","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":"23_CR10","first-page":"81","volume-title":"International Workshop on Coding and Cryptography \u2013 WCC 2005","author":"P. Gaborit","year":"2005","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: International Workshop on Coding and Cryptography \u2013 WCC 2005, Bergen, Norway, pp. 81\u201391. ACM Press, New York (2005)"},{"issue":"10","key":"23_CR11","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1049\/el:19730172","volume":"9","author":"M.N. Gulamhusein","year":"1973","unstructured":"Gulamhusein, M.N.: Simple matrix-theory proof of the discrete dyadic convolution theorem. Electronics Letters\u00a09(10), 238\u2013239 (1973)","journal-title":"Electronics Letters"},{"key":"23_CR12","unstructured":"Kobara, K.: Flexible quasi-dyadic code-based public-key encryption and signature. Cryptology ePrint Archive, Report 2009\/635 (2009)"},{"key":"23_CR13","unstructured":"McEliece, R.: A public-key cryptosystem based on algebraic coding theory. The Deep Space Network Progress Report, DSN PR 42\u201344 (1978), http:\/\/ipnpr.jpl.nasa.gov\/progressreport2\/42-44\/44N.PDF"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","volume-title":"Selected Areas in Cryptography","author":"R. Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact mcEliece keys from goppa codes. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol.\u00a05867, pp. 376\u2013392. Springer, Heidelberg (2009)"},{"issue":"2","key":"23_CR15","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory\u00a015(2), 159\u2013166 (1986)","journal-title":"Problems of Control and Information Theory"},{"issue":"2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11786-009-0015-8","volume":"3","author":"A. Otmani","year":"2010","unstructured":"Otmani, A., Tillich, J.-P., Dallot, L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. Mathematics in Computer Science\u00a03(2), 129\u2013140 (2010)","journal-title":"Mathematics in Computer Science"},{"issue":"2","key":"23_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N.J. Patterson","year":"1975","unstructured":"Patterson, N.J.: The algebraic decoding of Goppa codes. IEEE Transactions on Information Theory\u00a021(2), 203\u2013207 (1975)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"66","key":"23_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2307\/2001955","volume":"13","author":"S. Schechter","year":"1959","unstructured":"Schechter, S.: On the inversion of certain matrices. Mathematical Tables and Other Aids to Computation\u00a013(66), 73\u201377 (1959), http:\/\/www.jstor.org\/stable\/2001955","journal-title":"Mathematical Tables and Other Aids to Computation"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1995","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing\u00a026, 1484\u20131509 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR20","unstructured":"Umana, V.G., Leander, G.: Practical key recovery attacks on two McEliece variants. In: International Conference on Symbolic Computation and Cryptography \u2013 SCC 2010 (2010) (to appear)"},{"issue":"2","key":"23_CR21","first-page":"154","volume":"5","author":"D. Zheng","year":"2007","unstructured":"Zheng, D., Li, X., Chen, K.: Code-based ring signature scheme. I. J. Network Security\u00a05(2), 154\u2013157 (2007)","journal-title":"I. J. Network Security"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21518-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T01:35:55Z","timestamp":1560389755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21518-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215179","9783642215186"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21518-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}