{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T11:52:22Z","timestamp":1775044342589,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642254048","type":"print"},{"value":"9783642254055","type":"electronic"}],"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_12","type":"book-chapter","created":{"date-parts":[[2011,11,24]],"date-time":"2011-11-24T06:32:34Z","timestamp":1322116354000},"page":"179-199","source":"Crossref","is-referenced-by-count":27,"title":["Monoidic Codes in Cryptography"],"prefix":"10.1007","author":[{"given":"Paulo S. L. M.","family":"Barreto","sequence":"first","affiliation":[]},{"given":"Richard","family":"Lindner","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Misoczki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Post-Quantum Cryptography","year":"2008","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.): PQCrypto 2008. LNCS, vol.\u00a05299. Springer, Heidelberg (2008)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC code. In: IEEE International Symposium on Information Theory \u2013 ISIT 2007, pp. 2591\u20132595. IEEE (2007)","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"12_CR3","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":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-21518-6_23","volume-title":"Information Security and Cryptology","author":"P.S.L.M. Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Cayrel, P.-L., Misoczki, R., Niebuhr, R.: Quasi-Dyadic CFS Signatures. In: Lai, X., Yung, M., Lin, D. (eds.) Inscrypt 2010. LNCS, vol.\u00a06584, pp. 336\u2013349. Springer, Heidelberg (2011)"},{"key":"12_CR5","unstructured":"Barreto, P.S.L.M., Lindner, R., Misoczki, R.: Decoding square-free Goppa codes over $\\mathbb{F}_p$ . Cryptology ePrint Archive, Report 2010\/372 (2010), http:\/\/eprint.iacr.org\/2010\/372.pdf"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-19574-7_10","volume-title":"Selected Areas in Cryptography","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 143\u2013158. Springer, Heidelberg (2011)"},{"key":"12_CR7","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)"},{"key":"12_CR8","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. Courtois","year":"2001","unstructured":"Courtois, N., 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":"12_CR9","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. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 159\u2013170. Springer, Heidelberg (2011)"},{"key":"12_CR10","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":"12_CR11","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tilllich, J.-P.: Algebraic cryptanalysis of compact McEliece\u2019s variants \u2013 toward a complexity analysis. In: International Conference on Symbolic Computation and Cryptography \u2013 SCC 2010, pp. 45\u201356 (2010)","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"12_CR12","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":"12_CR13","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, pp. 81\u201391. ACM Press, Bergen (2005)"},{"key":"12_CR14","unstructured":"Gauthier Uma\u00f1a, V., Leander, G.: Practical key recovery attacks on two McEliece variants. In: Cid, C., Faug\u00e8re, J.-C. (eds.) International Conference on Symbolic Computation and Cryptography \u2013 SCC 2010, pp. 27\u201344 (2010)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Lang, S.: Algebra, revised 3rd edn. Springer, Heidelberg (2002)","DOI":"10.1007\/978-1-4613-0041-0"},{"key":"12_CR16","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)"},{"key":"12_CR17","first-page":"114","volume":"44","author":"R.J. McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Deep Space Network Progress Report\u00a044, 114\u2013116 (1978)","journal-title":"Deep Space Network Progress Report"},{"key":"12_CR18","first-page":"215","volume-title":"IEEE International Symposium on Information Theory \u2013 ISIT 2000","author":"C. Monico","year":"2000","unstructured":"Monico, C., Rosenthal, J., Shokrollahi, A.: Using low density parity check codes in the McEliece cryptosystem. In: IEEE International Symposium on Information Theory \u2013 ISIT 2000, p. 215. IEEE, Sorrento (2000)"},{"key":"12_CR19","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-Holland Mathematical Library, vol.\u00a016 (1977)"},{"issue":"2","key":"12_CR20","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":"12_CR21","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"},{"key":"12_CR22","unstructured":"Persichetti, E.: Compact McEliece keys based on quasi-dyadic Srivastava codes. Cryptology ePrint Archive, Report 2011\/179 (2011), http:\/\/eprint.iacr.org\/2011\/179.pdf"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","volume-title":"Post-Quantum Cryptography","author":"C. Peters","year":"2010","unstructured":"Peters, C.: Information-set Decoding For Linear Codes over $\\mathbb{F}_q$ . In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 81\u201394. Springer, Heidelberg (2010)"},{"key":"12_CR24","unstructured":"Peters, C.: Curves, Codes, and Cryptography. Ph.D. thesis, Technische Universiteit Eindhoven, the Netherlands (2011), http:\/\/alexandria.tue.nl\/extra2\/711052.pdf"},{"issue":"4","key":"12_CR25","first-page":"439","volume":"1","author":"V. Sidelnikov","year":"1992","unstructured":"Sidelnikov, V., Shestakov, S.: On the insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Mathematics and Applications\u00a01(4), 439\u2013444 (1992)","journal-title":"Discrete Mathematics and Applications"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TIT.1975.1055449","volume":"21","author":"K.K. Tzeng","year":"1975","unstructured":"Tzeng, K.K., Zimmermann, K.: On extending Goppa codes to cyclic codes. IEEE Transactions on Information Theory\u00a021, 712\u2013716 (1975)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25405-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T21:08:26Z","timestamp":1560978506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25405-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642254048","9783642254055"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25405-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}