{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:22:39Z","timestamp":1775794959618,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642054433","type":"print"},{"value":"9783642054457","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05445-7_24","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T15:03:23Z","timestamp":1257260603000},"page":"376-392","source":"Crossref","is-referenced-by-count":116,"title":["Compact McEliece Keys from Goppa Codes"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Misoczki","sequence":"first","affiliation":[]},{"given":"Paulo S. L. M.","family":"Barreto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"2591","DOI":"10.1109\/ISIT.2007.4557609","volume-title":"IEEE International Symposium on Information Theory \u2013 ISIT 2007","author":"M. Baldi","year":"2007","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, Nice, France, pp. 2591\u20132595. IEEE, Los Alamitos (2007)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","volume-title":"Security and Cryptography for Networks","author":"M. Baldi","year":"2008","unstructured":"Baldi, M., Chiaraluce, F., Bodrato, M.: A new analysis of the mcEliece cryptosystem based on QC-LDPC codes. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol.\u00a05229, pp. 246\u2013262. Springer, Heidelberg (2008)"},{"key":"24_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":"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), \n                    \n                      http:\/\/www.unilim.fr\/pages_perso\/philippe.gaborit\/reducing.pdf"},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E. Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory\u00a024(3), 384\u2013386 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"24_CR5","unstructured":"Bernstein, D.J.: List decoding for binary Goppa codes (2008) (preprint), \n                    \n                      http:\/\/cr.yp.to\/papers.html#goppalist"},{"key":"24_CR6","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post-Quantum Cryptography. Springer, Heidelberg (2008)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the mcEliece cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol.\u00a05299, pp. 31\u201346. Springer, Heidelberg (2008), \n                    \n                      http:\/\/www.springerlink.com\/content\/68v69185x478p53g"},{"key":"24_CR8","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)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/ISIT.2007.4557225","volume-title":"IEEE International Symposium on Information Theory \u2013 ISIT 2007","author":"P. Gaborit","year":"2007","unstructured":"Gaborit, P., Girault, M.: Lightweight code-based authentication and signature. In: IEEE International Symposium on Information Theory \u2013 ISIT 2007, Nice, France, pp. 191\u2013195. IEEE, Los Alamitos (2007)"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"J.K. Gibson","year":"1995","unstructured":"Gibson, J.K.: Severely denting the Gabidulin version of the McEliece public key cryptosystem. Designs, Codes and Cryptography\u00a06(1), 37\u201345 (1995)","journal-title":"Designs, Codes and Cryptography"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/3-540-68339-9_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J.K. Gibson","year":"1996","unstructured":"Gibson, J.K.: The security of the Gabidulin public key cryptosystem. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 212\u2013223. Springer, Heidelberg (1996)"},{"issue":"10","key":"24_CR12","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":"24_CR13","unstructured":"IEEE P1363 Working Group. IEEE 1363-1: Standard Specifications for Public-Key Cryptographic Techniques Based on Hard Problems over Lattices, Draft (2009), \n                    \n                      http:\/\/grouper.ieee.org\/groups\/1363\/lattPK\/index.html"},{"key":"24_CR14","first-page":"382","volume-title":"IEEE International Symposium on Information Theory \u2013 ISIT 1998","author":"P. Loidreau","year":"1998","unstructured":"Loidreau, P., Sendrier, N.: Some weak keys in McEliece public-key cryptosystem. In: IEEE International Symposium on Information Theory \u2013 ISIT 1998, Boston, USA, p. 382. IEEE, Los Alamitos (1998)"},{"key":"24_CR15","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-Holland Mathematical Library, vol.\u00a016 (1977)"},{"key":"24_CR16","unstructured":"McEliece, R.: A public-key cryptosystem based on algebraic coding theory. The Deep Space Network Progress Report, DSN PR 42\u201344 (1978), \n                    \n                      http:\/\/ipnpr.jpl.nasa.gov\/progressreport2\/42-44\/44N.PDF"},{"issue":"4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D. Micciancio","year":"2007","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Computational Complexity\u00a016(4), 365\u2013411 (2007)","journal-title":"Computational Complexity"},{"key":"24_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, Sorrento, Italy, p. 215. IEEE, Los Alamitos (2000)"},{"issue":"2","key":"24_CR19","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"},{"key":"24_CR20","unstructured":"European\u00a0Network of\u00a0Excellence\u00a0in Cryptology\u00a0(ECRYPT). ECRYPT yearly report on algorithms and keysizes (2007-2008). D.SPA.28 Rev. 1.1, IST-2002-507932 ECRYPT, 07\/2008 (2008), \n                    \n                      http:\/\/www.ecrypt.eu.org\/ecrypt1\/documents\/D.SPA.28-1.1.pdf"},{"key":"24_CR21","unstructured":"National\u00a0Institute of\u00a0Standards and Technology (NIST). Recommendation for key management \u2013 part 1: General (2007), \n                    \n                      http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-57\/sp800-57-Part1-revised2_Mar08-2007.pdf"},{"key":"24_CR22","unstructured":"Otmani, A., Tillich, J.-P., Dallot, L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (2008) (preprint), \n                    \n                      http:\/\/arxiv.org\/abs\/0804.0409v2"},{"issue":"2","key":"24_CR23","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":"4","key":"24_CR24","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1977.1055732","volume":"23","author":"D.V. Sarwate","year":"1977","unstructured":"Sarwate, D.V.: On the complexity of decoding Goppa codes. IEEE Transactions on Information Theory\u00a023(4), 515\u2013516 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"66","key":"24_CR25","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), \n                    \n                      http:\/\/www.jstor.org\/stable\/2001955","journal-title":"Mathematical Tables and Other Aids to Computation"},{"issue":"4","key":"24_CR26","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N. Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Transactions on Information Theory\u00a046(4), 1193\u20131203 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"24_CR27","first-page":"57","volume":"4","author":"V. Sidelnikov","year":"1992","unstructured":"Sidelnikov, V., Shestakov, S.: On cryptosystems based on generalized Reed-Solomon codes. Discrete Mathematics\u00a04(3), 57\u201363 (1992)","journal-title":"Discrete Mathematics"},{"key":"24_CR28","doi-asserted-by":"publisher","first-page":"721","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, 721\u2013726 (1975)","journal-title":"IEEE Transactions on Information Theory"},{"key":"24_CR29","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1109\/ISIT.2006.261651","volume-title":"IEEE International Symposium on Information Theory \u2013 ISIT 2006","author":"C. Wieschebrink","year":"2006","unstructured":"Wieschebrink, C.: Two NP-complete problems in coding theory with an application in code based cryptography. In: IEEE International Symposium on Information Theory \u2013 ISIT 2006, Seattle, USA, pp. 1733\u20131737. IEEE, Los Alamitos (2006)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05445-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T16:38:18Z","timestamp":1580315898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05445-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054433","9783642054457"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05445-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}