{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:44Z","timestamp":1763468264667,"version":"3.40.3"},"publisher-location":"Cham","reference-count":95,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319106823"},{"type":"electronic","value":"9783319106830"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10683-0_16","type":"book-chapter","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T15:54:11Z","timestamp":1427298851000},"page":"387-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Panorama of Post-quantum Cryptography"],"prefix":"10.1007","author":[{"given":"Paulo S. L. M.","family":"Barreto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felipe","family":"Piazza Biasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Dahab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julio C\u00e9sar","family":"L\u00f3pez-Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo M.","family":"de Morais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana D. Salina","family":"de Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geovandro C. C. F.","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jefferson E.","family":"Ricardini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,11]]},"reference":[{"key":"16_CR1","first-page":"99","volume-title":"Generating hard instances of lattice problems (extended abstract), in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201896","author":"M. Ajtai","year":"1996","unstructured":"M.\u00a0Ajtai, Generating hard instances of lattice problems (extended abstract), in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201896 (ACM, New York, 1996), pp.\u00a099\u2013108"},{"doi-asserted-by":"crossref","unstructured":"M.\u00a0Alabbadi, S.B. Wicker, A digital signature scheme based on linear error-correcting block codes, in Advances in Cryptology\u00a0\u2013 Asiacrypt \u201894, vol.\u00a0917 of Lecture Notes in Computer Science (Springer, New York, 1994), pp.\u00a0238\u2013348","key":"16_CR2","DOI":"10.1007\/BFb0000438"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"L\u00a0Babai, On lovsz lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"16_CR4","first-page":"2591","volume-title":"Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC code, in IEEE International Symposium on Information Theory \u2013 ISIT 2007","author":"M. Baldi","year":"2007","unstructured":"M.\u00a0Baldi, F.\u00a0Chiaraluce, Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC code, in IEEE International Symposium on Information Theory\u00a0\u2013 ISIT 2007 (IEEE, Nice, 2007), pp.\u00a02591\u20132595"},{"doi-asserted-by":"crossref","unstructured":"M.\u00a0Baldi, F.\u00a0Chiaraluce, M.\u00a0Bodrato, A new analysis of the McEliece cryptosystem based on QC-LDPC codes, in Security and Cryptography for Networks\u00a0\u2013 SCN 2008, vol.\u00a05229 of Lecture Notes in Computer Science (Springer, Amalfi, 2008), pp.\u00a0246\u2013262","key":"16_CR5","DOI":"10.1007\/978-3-540-85855-3_17"},{"doi-asserted-by":"crossref","unstructured":"R. Barbulescu, P. Gaudry, A. Joux, E. Thom\u00e9, A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. HAL-INRIA technical report, http:\/\/hal.inria.fr\/hal-00835446\/ (2013)","key":"16_CR6","DOI":"10.1007\/978-3-642-55220-5_1"},{"doi-asserted-by":"crossref","unstructured":"M. Bellare, P. Rogaway, Random oracles are practical: A paradigm for designing efficient protocols, in Proceedings of the 1st ACM conference on Computer and communications security (ACM, 1993), pp.\u00a062\u201373","key":"16_CR7","DOI":"10.1145\/168588.168596"},{"key":"16_CR8","first-page":"77","volume-title":"Reducing key length of the McEliece cryptosystem, in Progress in Cryptology \u2013 Africacrypt 2009, Lecture Notes in Computer Science","author":"T.P. Berger","year":"2009","unstructured":"T.P. Berger, P.-L. Cayrel, P.\u00a0Gaborit, A.\u00a0Otmani, Reducing key length of the McEliece cryptosystem, in Progress in Cryptology\u00a0\u2013 Africacrypt 2009, Lecture Notes in Computer Science (Springer, Gammarth, 2009), pp.\u00a077\u201397"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E. Berlekamp","year":"1978","unstructured":"E.\u00a0Berlekamp, R.\u00a0McEliece, H.\u00a0van Tilborg, On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"D.\u00a0Bernstein, T.\u00a0Lange, C.\u00a0Peters, Smaller decoding exponents: ball-collision decoding, in Advances in Cryptology\u00a0\u2013 Crypto 2011, vol.\u00a06841 of Lecture Notes in Computer Science (Springer, Santa Barbara, 2011), pp.\u00a0743\u2013760","key":"16_CR10","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"16_CR11","first-page":"62","volume-title":"List decoding for binary Goppa codes, in Coding and Cryptology\u2014Third International Workshop, IWCC 2011, Lecture Notes in Computer Science","author":"D.J. Bernstein","year":"2011","unstructured":"D.J. Bernstein, List decoding for binary Goppa codes, in Coding and Cryptology\u2014Third International Workshop, IWCC 2011, Lecture Notes in Computer Science (Springer, Qingdao, 2011), pp.\u00a062\u201380"},{"key":"16_CR12","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2008","unstructured":"D.J. Bernstein, J.\u00a0Buchmann, E.\u00a0Dahmen, Post-Quantum Cryptography (Springer, Heidelberg, 2008)"},{"doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, T.\u00a0Lange, C.\u00a0Peters, Attacking and defending the McEliece cryptosystem, in Post-Quantum Cryptography\u00a0\u2013 PQCrypto 2008, vol.\u00a05299 of Lecture Notes in Computer Science (Springer, New York, 2008), pp.\u00a031\u201346. http:\/\/www.springerlink.com\/content\/68v69185x478p53g","key":"16_CR13","DOI":"10.1007\/978-3-540-88403-3_3"},{"doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, T.\u00a0Lange, C.\u00a0Peters, Wild McEliece, in Selected Areas in Cryptography\u00a0\u2013 SAC 2010, vol.\u00a06544 of Lecture Notes in Computer Science (Springer, Waterloo, 2010), pp.\u00a0143\u2013158","key":"16_CR14","DOI":"10.1007\/978-3-642-19574-7_10"},{"unstructured":"G.\u00a0Bertoni, J.\u00a0Daemen, M.\u00a0Peeters, G.\u00a0Van Assche, Keccak specifications. Submission to NIST (2010). http:\/\/keccak.noekeon.org\/Keccak-specifications.pdf","key":"16_CR15"},{"unstructured":"G. Bertoni, J. Daemen, M. Peeters, G. Van Assche, Sponge functions. ECRYPT Hash Workshop 2007 (2007). Also available as public comment to NIST from http:\/\/www.csrc.nist.gov\/pki\/HashWorkshop\/Public_Comments\/2007_May.html","key":"16_CR16"},{"doi-asserted-by":"crossref","unstructured":"D. Boneh, C. Gentry, M. Hamburg, Space-efficient identity based encryption without pairings, in FOCS, pp.\u00a0647\u2013657 (2007)","key":"16_CR17","DOI":"10.1109\/FOCS.2007.50"},{"doi-asserted-by":"crossref","unstructured":"A.\u00a0Braeken, C.\u00a0Wolf, B.\u00a0Preneel, A study of the security of unbalanced oil and vinegar signature schemes, in Topics in Cryptology\u00a0\u2013 CT-RSA 2005, vol.\u00a03376 of Lecture Notes in Computer Science (Springer, New York, 2005), pp.\u00a029\u201343","key":"16_CR18","DOI":"10.1007\/978-3-540-30574-3_4"},{"key":"16_CR19","first-page":"109","volume":"18","author":"Z. Brakerski","year":"2011","unstructured":"Z. Brakerski, V. Vaikuntanathan, Efficient fully homomorphic encryption from (standard) lwe. Electron. Colloq. Comput. Complex. 18, 109 (2011)","journal-title":"Electron. Colloq. Comput. Complex."},{"doi-asserted-by":"crossref","unstructured":"J.\u00a0Buchmann, C.\u00a0Coronado, E.\u00a0Dahmen, M.\u00a0Dring, E.\u00a0Klintsevich, CMSS\u00a0\u2013 an improved merkle signature scheme, in Progress in Cryptology INDOCRYPT 2006, vol.\u00a04329 of Lecture Notes in Computer Science (Springer, New York, 2006), pp.\u00a0349\u2013363","key":"16_CR20","DOI":"10.1007\/11941378_25"},{"doi-asserted-by":"crossref","unstructured":"J.\u00a0Buchmann, E.\u00a0Dahmen, S.\u00a0Ereth, A.\u00a0Hlsing, M.\u00a0Rckert, On the security of the Winternitz one-time signature scheme, in Progress in Cryptology\u00a0\u2013 AFRICACRYPT 2011, vol.\u00a06737 of Lecture Notes in Computer Science (Springer, New York, 2011), pp.\u00a0363\u2013378","key":"16_CR21","DOI":"10.1007\/978-3-642-21969-6_23"},{"doi-asserted-by":"crossref","unstructured":"J.\u00a0Buchmann, E.\u00a0Dahmen, A.\u00a0Hlsing, XMSS-a practical secure signature scheme based on minimal security assumptions, in Cryptology ePrint Archive - Report 2011\/484. ePrint (2011)","key":"16_CR22","DOI":"10.1007\/978-3-642-25405-5_8"},{"doi-asserted-by":"crossref","unstructured":"J.\u00a0Buchmann, E.\u00a0Dahmen, E.\u00a0Klintsevich, K.\u00a0Okeya, C.\u00a0Vuillaume, Merkle signatures with virtually unlimited signature capacity, in Applied Cryptography and Network Security\u00a0\u2013 ACNS 2007, vol.\u00a04521 of Lecture Notes in Computer Science (Springer, New York, 2007), pp.\u00a031\u201345","key":"16_CR23","DOI":"10.1007\/978-3-540-72738-5_3"},{"doi-asserted-by":"crossref","unstructured":"J.\u00a0Buchmann, E.\u00a0Dahmen, M.\u00a0Schneider, Merkle tree traversal revisited, in Post-Quantum Cryptography\u00a0\u2013 PQCrypto 2008, vol.\u00a05299 of Lecture Notes in Computer Science (Springer, New York, 2008), pp.\u00a063\u201378","key":"16_CR24","DOI":"10.1007\/978-3-540-88403-3_5"},{"unstructured":"S. Contini, A.K. Lenstra, R. Steinfeld, VSH, an Efficient and Provable Collision Resistant Hash Function. Cryptology ePrint Archive, Report 2005\/193 (2005). http:\/\/eprint.iacr.org\/","key":"16_CR25"},{"doi-asserted-by":"crossref","unstructured":"N.\u00a0Courtois, M.\u00a0Finiasz, N.\u00a0Sendrier, How to achieve a McEliece-based digital signature scheme, in Advances in Cryptology\u00a0\u2013 Asiacrypt 2001, vol.\u00a02248 of Lecture Notes in Computer Science (Springer, Gold Coast, 2001), pp.\u00a0157\u2013174","key":"16_CR26","DOI":"10.1007\/3-540-45682-1_10"},{"key":"16_CR27","volume-title":"Foundations of Secure Computation","author":"R.A. DeMillo","year":"1978","unstructured":"R.A. DeMillo, D.P. Dobkin, A.K. Jones, R.J. Lipton, Foundations of Secure Computation (Academic Press, New York, 1978)"},{"doi-asserted-by":"crossref","unstructured":"J.\u00a0Ding, D.\u00a0Schmidt, Rainbow, a new multivariable polynomial signature scheme, in International Conference on Applied Cryptography and Network Security\u00a0\u2013 ACNS 2005, vol.\u00a03531 of Lecture Notes in Computer Science (Springer, New York, 2005), pp.\u00a0164\u2013175","key":"16_CR28","DOI":"10.1007\/11496137_12"},{"doi-asserted-by":"crossref","unstructured":"C.\u00a0Dods, N.\u00a0Smart, M.\u00a0Stam, Hash based digital signature schemes, in Cryptography and Coding, vol.\u00a03796 of Lecture Notes in Computer Science (Springer, New York, 2005), pp.\u00a096\u2013115","key":"16_CR29","DOI":"10.1007\/11586821_8"},{"doi-asserted-by":"crossref","unstructured":"J.-C. Faug\u00e8re, A.\u00a0Otmani, L.\u00a0Perret, J.-P. Tilllich, Algebraic cryptanalysis of McEliece variants with compact keys, in Advances in Cryptology\u00a0\u2013 Eurocrypt 2010, vol.\u00a06110 of Lecture Notes in Computer Science (Springer, Nice, 2010), pp.\u00a0279\u2013298","key":"16_CR30","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"16_CR31","first-page":"81","volume-title":"Shorter keys for code based cryptography, in International Workshop on Coding and Cryptography \u2013 WCC 2005","author":"P. Gaborit","year":"2005","unstructured":"P.\u00a0Gaborit, Shorter keys for code based cryptography, in International Workshop on Coding and Cryptography\u00a0\u2013 WCC 2005 (ACM Press, Bergen, 2005), pp.\u00a081\u201391"},{"issue":"1","key":"16_CR32","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R.G. Gallager","year":"1962","unstructured":"R.G. Gallager, Low-density parity-check codes. Information Theory, IRE Transactions on 8(1), 21\u201328 (1962)","journal-title":"Information Theory, IRE Transactions on"},{"key":"16_CR33","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability\u00a0\u2013 A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, New York, 1979)"},{"doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, Candidate multilinear maps from ideal lattices, in Advances in Cryptology\u00a0\u2013 EUROCRYPT 2013, pp.\u00a01\u201317 (2013)","key":"16_CR34","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"16_CR35","first-page":"451","volume":"2013","author":"S. Garg","year":"2013","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, B. Waters, Candidate indistinguishability obfuscation and functional encryption for all circuits, IACR Cryptology ePrint Archive 2013, 451 (2013)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"16_CR36","volume-title":"Practical key recovery attacks on two McEliece variants, in International Conference on Symbolic Computation and Cryptography \u2013 SCC 2010","author":"V. Gauthier","year":"2010","unstructured":"V.\u00a0Gauthier, G.\u00a0Leander, Practical key recovery attacks on two McEliece variants, in International Conference on Symbolic Computation and Cryptography\u00a0\u2013 SCC 2010 (Springer, Egham, 2010)"},{"doi-asserted-by":"crossref","unstructured":"C. Gentry, A fully homomorphic encryption scheme. PhD thesis, Stanford University, 2009. crypto.stanford.edu\/craig","key":"16_CR37","DOI":"10.1145\/1536414.1536440"},{"doi-asserted-by":"crossref","unstructured":"C. Gentry, Encrypted messages from the heights of cryptomania, in TCC, pp.\u00a0120\u2013121 (2013)","key":"16_CR38","DOI":"10.1007\/978-3-642-36594-2_7"},{"key":"16_CR39","first-page":"197","volume-title":"Trapdoors for hard lattices and new cryptographic constructions, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC \u201808","author":"C. Gentry","year":"2008","unstructured":"C. Gentry, C. Peikert, V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC \u201808 (ACM, New York, 2008), pp.\u00a0197\u2013206"},{"doi-asserted-by":"crossref","unstructured":"C. Gentry, A. Sahai, B. Waters, Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based, in Advances in Cryptology\u00a0\u2013 CRYPTO \u201889, vol.\u00a08042 of Lecture Notes in Computer Science (Springer, New York, 2013), pp.\u00a075\u201392","key":"16_CR40","DOI":"10.1007\/978-3-642-40041-4_5"},{"doi-asserted-by":"crossref","unstructured":"J.K. Gibson, The security of the Gabidulin public key cryptosystem, in Advances in Cryptology\u00a0\u2013 Eurocrypt \u201896, vol.\u00a01070 of Lecture Notes in Computer Science (Springer, Zaragoza, 1996), pp.\u00a0212\u2013223","key":"16_CR41","DOI":"10.1007\/3-540-68339-9_19"},{"doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, S.\u00a0Goldwasser, S.\u00a0Halevi, Public-key cryptosystems from lattice reduction problems, in Advances in Cryptology\u00a0\u2013 CRYPTO \u201897, vol.\u00a01294 of Lecture Notes in Computer Science (Springer, New York, 1997), pp.\u00a0112\u2013131","key":"16_CR42","DOI":"10.1007\/BFb0052231"},{"key":"16_CR43","first-page":"24","volume":"6","author":"V.D. Goppa","year":"1970","unstructured":"V.D. Goppa, A new class of linear error correcting codes. Problemy Peredachi Informatsii 6, 24\u201330 (1970)","journal-title":"Problemy Peredachi Informatsii"},{"unstructured":"A.\u00a0H\u00fclsing, Practical forward secure signatures using minimal security assumptions. PhD thesis, TU Darmstadt, 2013","key":"16_CR44"},{"key":"16_CR45","first-page":"267","volume-title":"Ntru: A ring-based public key cryptosystem, in Lecture Notes in Computer Science","author":"J. Hoffstein","year":"1998","unstructured":"J. Hoffstein, J. Pipher, J.H. Silverman, Ntru: A ring-based public key cryptosystem, in Lecture Notes in Computer Science (Springer, New York, 1998), pp.\u00a0267\u2013288"},{"key":"16_CR46","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"W.C. Huffman","year":"2003","unstructured":"W.C. Huffman, V.\u00a0Pless, Fundamentals of Error-Correcting Codes (Cambridge University Press, Cambridge, 2003)"},{"doi-asserted-by":"crossref","unstructured":"A.\u00a0Kipnis, A.\u00a0Shamir, Cryptanalysis of the oil and vinegar signature scheme, in ed. by H.\u00a0Krawczyk. Advances in Cryptology\u00a0\u2013 Crypto 1998, vol.\u00a01462 of Lecture Notes in Computer Science (Springer, New York, 1998), pp.\u00a0257\u2013266","key":"16_CR47","DOI":"10.1007\/BFb0055733"},{"doi-asserted-by":"crossref","unstructured":"A. Kipnis, J. Patarin, L. Goubin, Unbalanced oil and vinegar signature schemes, in ed. by J.\u00a0Stern. Advances in Cryptology\u00a0\u2013 EUROCRYPT \u201899, vol.\u00a01592 of Lecture Notes in Computer Science (Springer, New York, 1999), pp.\u00a0206\u2013222","key":"16_CR48","DOI":"10.1007\/3-540-48910-X_15"},{"unstructured":"L.\u00a0Lamport, Constructing digital signatures from a one way function, in SRI International. CSL-98 (1979)","key":"16_CR49"},{"issue":"4","key":"16_CR50","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra, L.\u00a0Lovsz, Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"doi-asserted-by":"crossref","unstructured":"A. Lewko, T. Okamoto, A. Sahai, K. Takashima, B. Waters, Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption, in H. Gilbert. Advances in Cryptology\u00a0\u2013 EUROCRYPT 2010, vol.\u00a06110 of Lecture Notes in Computer Science (Springer, Berlin\/Heidelberg, 2010), pp.\u00a062\u201391","key":"16_CR51","DOI":"10.1007\/978-3-642-13190-5_4"},{"doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, C. Peikert, O. Regev, On ideal lattices and learning with errors over rings. Adv. Cryptology EUROCRYPT 2010 6110\/2010(015848), 1\u201323 (2010)","key":"16_CR52","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"16_CR53","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, vol.\u00a016 (North-Holland Mathematical Library, Amsterdam, 1977)"},{"unstructured":"S.M. Matyas, C.H. Meyer, J.\u00a0Oseas, Generating strong one-way functions with cryptographic algorithm, IBM Techn. Disclosure Bull., 1985","key":"16_CR54"},{"unstructured":"R.\u00a0McEliece, 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. Acesso em:.","key":"16_CR55"},{"unstructured":"R.C. Merkle, Secrecy, Authentication, and Public Key Systems. Stanford Ph.D. thesis, 1979","key":"16_CR56"},{"doi-asserted-by":"crossref","unstructured":"R.C. Merkle, A digital signature based on a conventional encryption function, in Advances in Cryptology\u00a0\u2013 CRYPTO\u201987, vol.\u00a0435 of Lecture Notes in Computer Science (Springer, New York, 1987), pp.\u00a0369\u2013378","key":"16_CR57","DOI":"10.1007\/3-540-48184-2_32"},{"doi-asserted-by":"crossref","unstructured":"D. Micciancio, C. Peikert, Trapdoors for lattices: Simpler, tighter, faster, smaller, in ed. by D.\u00a0Pointcheval, T. Johansson. Advances in Cryptology EUROCRYPT 2012, vol.\u00a07237 of Lecture Notes in Computer Science (Springer, Berlin\/Heidelberg, 2012), pp.\u00a0700\u2013718","key":"16_CR58","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"16_CR59","first-page":"417","volume-title":"Use of elliptic curves in cryptography, in Advances in Cryptology \u2014 Crypto \u201885","author":"V.S. Miller","year":"1986","unstructured":"V.S. Miller, Use of elliptic curves in cryptography, in Advances in Cryptology \u2014 Crypto \u201885 (Springer, New York, 1986), pp.\u00a0417\u2013426"},{"doi-asserted-by":"crossref","unstructured":"R.\u00a0Misoczki, N.\u00a0Sendrier, J.-P. Tilllich, P.S.L.M. Barreto, MDPC-McEliece: New McEliece variants from moderate density parity-check codes. Cryptology ePrint Archive, Report 2012\/409, 2012. http:\/\/eprint.iacr.org\/2012\/409","key":"16_CR60","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"16_CR61","first-page":"215","volume-title":"Using low density parity check codes in the McEliece cryptosystem, in IEEE International Symposium on Information Theory \u2013 ISIT 2000","author":"C. Monico","year":"2000","unstructured":"C.\u00a0Monico, J.\u00a0Rosenthal, A.\u00a0Shokrollahi, Using low density parity check codes in the McEliece cryptosystem, in IEEE International Symposium on Information Theory\u00a0\u2013 ISIT 2000 (IEEE, Sorrento, 2000), p.\u00a0215"},{"key":"16_CR62","volume-title":"Encriptao homomrfica, in XII Simpsio Brasileiro em Segurana da Informao e de Sistemas Computacionais: Minicursos, SBSeg","author":"E.M. Morais","year":"2012","unstructured":"E.M. Morais, R.\u00a0Dahab, Encriptao homomrfica, in XII Simpsio Brasileiro em Segurana da Informao e de Sistemas Computacionais: Minicursos, SBSeg (2012)"},{"doi-asserted-by":"crossref","unstructured":"P. Nguyen, O. Regev, Learning a parallelepiped: Cryptanalysis of ggh and ntru signatures, in S. Vaudenay. Advances in Cryptology - EUROCRYPT 2006, vol.\u00a04004 of Lecture Notes in Computer Science (Springer, Berlin\/Heidelberg, 2006), pp.\u00a0271\u2013288","key":"16_CR63","DOI":"10.1007\/11761679_17"},{"issue":"2","key":"16_CR64","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"H.\u00a0Niederreiter, Knapsack-type cryptosystems and algebraic coding theory. Prob. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Prob. Control Inf. Theory"},{"unstructured":"NIST, Federal Information Processing Standard FIPS 186-3\u00a0\u2013 Digital Signature Standard (DSS)\u00a0\u2013 6. The Elliptic Curve Digital Signature Algorithm (ECDSA) (National Institute of Standards and Technology (NIST), Gaithersburg, 2012). http:\/\/csrc.nist.gov\/publications\/fips\/fips186-3\/fips_186-3.pdf","key":"16_CR65"},{"key":"16_CR66","volume-title":"Implementa\u00e7\u00e3o em software do Esquema de Assinatura Digital de Merkle e suas variantes, in Brazilian Symposium on Information and Computer Systems Security \u2013 SBSeg 2013 (SBC","author":"A. K. D. S. Oliveira","year":"2013","unstructured":"A.\u00a0K. D.\u00a0S. Oliveira, J.\u00a0L\u00f3pez. Implementa\u00e7\u00e3o em software do Esquema de Assinatura Digital de Merkle e suas variantes, in Brazilian Symposium on Information and Computer Systems Security\u00a0\u2013 SBSeg 2013 (SBC, 2013)"},{"issue":"2","key":"16_CR67","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11786-009-0015-8","volume":"3","author":"A. Otmani","year":"2010","unstructured":"A.\u00a0Otmani, J.-P. Tillich, L.\u00a0Dallot, Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. Math. Comput. Sci. 3(2), 129\u2013140 (2010)","journal-title":"Math. Comput. Sci."},{"unstructured":"J.\u00a0Patarin, The oil and vinegar signature scheme, in Dagstuhl Workshop on Cryptography (1997). Transparencies","key":"16_CR68"},{"doi-asserted-by":"crossref","unstructured":"J.\u00a0Patarin, L.\u00a0Goubin, Trapdoor one-way permutations and multivariate polynomials, in ICICS\u201997, vol.\u00a01334 of Lecture Notes in Computer Science (Springer, New York, 1997), pp.\u00a0356\u2013368","key":"16_CR69","DOI":"10.1007\/BFb0028491"},{"doi-asserted-by":"crossref","unstructured":"J. Patarin, Hidden fields equations (hfe) and isomorphisms of polynomials (ip): Two new families of asymmetric algorithms, in ed. by U. Maurer. Advances in Cryptology\u00a0\u2013 EUROCRYPT \u201896, vol.\u00a01070 of Lecture Notes in Computer Science (Springer, Berlin\/Heidelberg, 1996), pp.\u00a033\u201348","key":"16_CR70","DOI":"10.1007\/3-540-68339-9_4"},{"key":"16_CR71","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0054126","volume-title":"Improved algorithms for isomorphisms of polynomials, in Advances in Cryptology \u2013 EUROCRYPT \u201898","author":"J. Patarin","year":"1998","unstructured":"J. Patarin, L. Goubin, N. Courtois, Improved algorithms for isomorphisms of polynomials, in Advances in Cryptology\u00a0\u2013 EUROCRYPT \u201898 (Springer, New York, 1998), pp.\u00a0184\u2013200"},{"issue":"2","key":"16_CR72","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N.J. Patterson","year":"1975","unstructured":"N.J. Patterson, The algebraic decoding of Goppa codes. IEEE Trans. Inf. Theory 21(2), 203\u2013207 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR73","first-page":"333","volume-title":"Public-key cryptosystems from the worst-case shortest vector problem: extended abstract, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC \u201809","author":"C. Peikert","year":"2009","unstructured":"C. Peikert, Public-key cryptosystems from the worst-case shortest vector problem: extended abstract, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC \u201809 (ACM, New York, 2009), pp.\u00a0333\u2013342"},{"doi-asserted-by":"crossref","unstructured":"A.\u00a0Petzoldt, S.\u00a0Bulygin, J.\u00a0Buchmann, CyclicRainbow\u00a0\u2013 a multivariate signature scheme with a partially cyclic public key, in ed. by G. Gong, K. Gupta. Progress in Cryptology\u00a0\u2013 Indocrypt 2010, vol.\u00a06498 of Lecture Notes in Computer Science (Springer, Berlin\/Heidelberg, 2010), pp.\u00a033\u201348","key":"16_CR74","DOI":"10.1007\/978-3-642-17401-8_4"},{"doi-asserted-by":"crossref","unstructured":"A.\u00a0Petzoldt, S.\u00a0Bulygin, J.\u00a0Buchmann, Selecting parameters for the Rainbow signature scheme, in ed. by N. Sendrier Post-Quantum Cryptography\u00a0\u2013 PQCrypto 2010, vol.\u00a06061 of Lecture Notes in Computer Science (Springer, Berlin\/Heidelberg, 2010), pp.\u00a0218\u2013240. Extended Version: http:\/\/eprint.iacr.org\/2010\/437","key":"16_CR75","DOI":"10.1007\/978-3-642-12929-2_16"},{"doi-asserted-by":"crossref","unstructured":"A.\u00a0Petzoldt, S.\u00a0Bulygin, J.\u00a0Buchmann, Linear recurring sequences for the UOV key generation, in International Conference on Practice and Theory in Public Key Cryptography\u00a0\u2013 PKC 2011, vol.\u00a06571 of Lecture Notes in Computer Science (Springer, Berlin\/Heidelberg, 2011), pp.\u00a0335\u2013350","key":"16_CR76","DOI":"10.1007\/978-3-642-19379-8_21"},{"doi-asserted-by":"crossref","unstructured":"A. Petzoldt, S. Bulygin, J. Buchmann, Cyclicrainbow - a multivariate signature scheme with a partially cyclic public key, in ed. by G. Gong, K.C. Gupta. INDOCRYPT, volume\u00a06498 of Lecture Notes in Computer Science (Springer, New York, 2010), pp.\u00a033\u201348","key":"16_CR77","DOI":"10.1007\/978-3-642-17401-8_4"},{"unstructured":"B.\u00a0Preneel, Analysis and design of cryptographic hash functions. PhD thesis, Katholieke Universiteit Leuven, 1983","key":"16_CR78"},{"doi-asserted-by":"crossref","unstructured":"L.\u00a0Rausch, A.\u00a0Hlsing, J.\u00a0Buchmann, Optimal parameters for \n$$xmss^{\\mathrm{MT}}$$\n, in CD-ARES 2013, vol.\u00a08128 of Lecture Notes in Computer Science (Springer, New York, 2013), pp.\u00a0194\u2013208","key":"16_CR79","DOI":"10.1007\/978-3-642-40588-4_14"},{"key":"16_CR80","first-page":"191","volume-title":"The learning with errors problem (invited survey), in IEEE Conference on Computational Complexity","author":"O. Regev","year":"2010","unstructured":"O. Regev, The learning with errors problem (invited survey), in IEEE Conference on Computational Complexity (IEEE Computer Society, Washington, DC, 2010), pp.\u00a0191\u2013204"},{"key":"16_CR81","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A.\u00a0Shamir, L.\u00a0Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"unstructured":"A. Sahai, B. Waters, Attribute-based encryption for circuits from multilinear maps. CoRR, abs\/1210.5287 (2012)","key":"16_CR82"},{"doi-asserted-by":"crossref","unstructured":"N. Sendrier, Decoding one out of many, in ed. by B-Y. Yang. Post-Quantum Cryptography\u00a0\u2013 PQCrypto 2011, vol.\u00a07071 of Lecture Notes in Computer Science (Springer, Berlin\/Heidelberg, 2011), pp.\u00a051\u201367. 10.1007\/978-3-642-25405-5-4","key":"16_CR83","DOI":"10.1007\/978-3-642-25405-5_4"},{"key":"16_CR84","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"16_CR85","first-page":"34","volume-title":"A novel cryptoprocessor architecture for chained merkle signature scheme, in Microprocessors and Microsystems","author":"A. Shoufan","year":"2011","unstructured":"A.\u00a0Shoufan, N.\u00a0Huber, H.\u00a0Molter, A novel cryptoprocessor architecture for chained merkle signature scheme, in Microprocessors and Microsystems (Elsevier, Amsterdam, 2011), pp.\u00a034\u201347"},{"key":"16_CR86","first-page":"27","volume-title":"Making ntru as secure as worst-case problems over ideal lattices, in Proceedings of the 30th Annual International Conference on Theory and Applications of Cryptographic Techniques: Advances in Cryptology, EUROCRYPT\u201911","author":"D. Stehl\u00e9","year":"2011","unstructured":"D. Stehl\u00e9, R. Steinfeld, Making ntru as secure as worst-case problems over ideal lattices, in Proceedings of the 30th Annual International Conference on Theory and Applications of Cryptographic Techniques: Advances in Cryptology, EUROCRYPT\u201911 (Springer, Berlin, Heidelberg, 2011), pp.\u00a027\u201347"},{"key":"16_CR87","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume":"388","author":"J. Stern","year":"1989","unstructured":"J.\u00a0Stern, A method for finding codewords of small weight. Coding Theory Appl. 388, 106\u2013133 (1989)","journal-title":"Coding Theory Appl."},{"doi-asserted-by":"crossref","unstructured":"J.\u00a0Stern, Can one design a signature scheme based on error-correcting codes? in Advances in Cryptology\u00a0\u2013 ASIACRYPT\u201994, vol.\u00a0917 of Lecture Notes in Computer Science (Springer, New York, 1994), pp.\u00a0426\u2013428","key":"16_CR88","DOI":"10.1007\/BFb0000454"},{"doi-asserted-by":"crossref","unstructured":"M.\u00a0Szydlo, Merkle tree traversal in log space and time, in Advances in Cryptology\u00a0\u2013 Eurocrypt 2004, vol.\u00a03027 of Lecture Notes in Computer Science (Springer, New York, 2004), pp.\u00a0541\u2013554","key":"16_CR89","DOI":"10.1007\/978-3-540-24676-3_32"},{"key":"16_CR90","first-page":"226","volume-title":"Spectral graphs for quasi-cyclic LDPC codes, in IEEE International Symposium on Information Theory \u2013 ISIT 2001","author":"R.M. Tanner","year":"2001","unstructured":"R.M. Tanner, Spectral graphs for quasi-cyclic LDPC codes, in IEEE International Symposium on Information Theory\u00a0\u2013 ISIT 2001 (IEEE, Washington, DC, 2001), p.\u00a0226"},{"unstructured":"E.\u00a0Thomae, A generalization of the Rainbow band separation attack and its applications to multivariate schemes. Cryptology ePrint Archive, Report 2012\/223, 2012. http:\/\/eprint.iacr.org\/2012\/223.","key":"16_CR91"},{"key":"16_CR92","first-page":"1733","volume-title":"Two NP-complete problems in coding theory with an application in code based cryptography, in IEEE International Symposium on Information Theory \u2013 ISIT 2006","author":"C. Wieschebrink","year":"2006","unstructured":"C.\u00a0Wieschebrink, Two NP-complete problems in coding theory with an application in code based cryptography, in IEEE International Symposium on Information Theory\u00a0\u2013 ISIT 2006 (IEEE, Seattle, 2006), pp.\u00a01733\u20131737"},{"key":"16_CR93","first-page":"203","volume-title":"Producing a one-way hash function from DES, in Advances in Cryptology \u2013 CRYPTO \u201883","author":"R.S. Winternitz","year":"1983","unstructured":"R.S. Winternitz, Producing a one-way hash function from DES, in Advances in Cryptology\u00a0\u2013 CRYPTO \u201883 (Springer, New York, 1983), pp.\u00a0203\u2013207"},{"key":"16_CR94","first-page":"77","volume":"2005","author":"C. Wolf","year":"2005","unstructured":"C. Wolf, B. Preneel, Taxonomy of public key schemes based on the problem of multivariate quadratic equations. IACR Cryptology ePrint Archive 2005, 77 (2005)","journal-title":"IACR Cryptology ePrint Archive"},{"doi-asserted-by":"crossref","unstructured":"T.\u00a0Yasuda, K\u00a0Sakurai, T.\u00a0Takagi, Reducing the key size of Rainbow using non-commutative rings, in Topics in Cryptology\u00a0\u2013 CT-RSA 2012, vol.\u00a07178 of Lecture Notes in Computer Science (Springer, New York, 2012), pp.\u00a068\u201383","key":"16_CR95","DOI":"10.1007\/978-3-642-27954-6_5"}],"container-title":["Open Problems in Mathematics and Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10683-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T14:00:39Z","timestamp":1714744839000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-10683-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319106823","9783319106830"],"references-count":95,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10683-0_16","relation":{},"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"11 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}