{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T10:59:34Z","timestamp":1777546774246,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540003243","type":"print"},{"value":"9783540362883","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_25","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T16:45:01Z","timestamp":1180889101000},"page":"337-350","source":"Crossref","is-referenced-by-count":31,"title":["On the Security of HFE, HFEv- and Quartz"],"prefix":"10.1007","author":[{"given":"Nicolas T.","family":"Courtois","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus","family":"Daum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Felke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1006\/jsco.1994.1061","volume":"18","author":"B. Barkee","year":"1994","unstructured":"Boo Barkee, Deh Cac Can, Julia Ecks, Theo Moriarty, R. F. Ree: Why You Cannot Even Hope to use Gr\u00f6bner Bases in Public Key Cryptography: An Open Letter to a Scientist Who Failed and a Challenge to Those Who Have Not Yet Failed, in Journal of Symbolic Computation 18, 1994, pp. 497\u2013501 341, 343","journal-title":"Journal of Symbolic Computation"},{"key":"25_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Asiacrypt","author":"D. Boneh","year":"2001","unstructured":"Dan Boneh, H. Shacham, and B. Lynn: Short signatures from the Weil pairing, Asiacrypt 2001, LNCS 2139, Springer, pp. 514\u2013532. 348"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Don Coppersmith, Shmuel Winograd: Matrix multiplication via arithmetic progressions; J. Symbolic Computation (1990), 9, pp. 251\u2013280. 346","journal-title":"J. Symbolic Computation"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"David Cox, John Little, Donal O\u2019shea: Ideals, Varieties, and Algorithms, Springer-Verlag, 1992 340, 341","DOI":"10.1007\/978-1-4757-2181-2"},{"key":"25_CR5","unstructured":"Francisco Corella: A fast implementation of DESan d triple DESon PARISC 2.0. http:\/\/www.usenix.org\/events\/osdi2000\/wiess2000\/full papers\/ corella\/corella.pdf 347"},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"How to achieve a McEliece-based Digital Signature Scheme","author":"N. Courtois","year":"2001","unstructured":"Nicolas Courtois, Matthieu Finiasz and Nicolas Sendrier: How to achieve a McEliece-based Digital Signature Scheme; Asiacrypt 2001, LNCS2248, Springer, pp. 157\u2013174. Available at http:\/\/www.cryptosystem.net\/mceliece\/ . 348"},{"key":"25_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology, Eurocrypt\u20192000","author":"N. Courtois","year":"2000","unstructured":"Nicolas Courtois, Adi Shamir, Jacques Patarin, Alexander Klimov, Efficient Algorithms for solving Overdefined Systems of Multivariate Polynomial Equations, in Advances in Cryptology, Eurocrypt\u20192000, LNCS 1807, Springer-Verlag, pp. 392\u2013407. 340, 344"},{"key":"25_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-45353-9_20","volume-title":"The security of Hidden Field Equations (HFE)","author":"N. Courtois","year":"2001","unstructured":"Nicolas Courtois: The security of Hidden Field Equations (HFE); Cryptographers\u2019 Track RSA Conference 2001, San Francisco 8\u201312 Avril 2001, LNCS2020, Springer-Verlag, pp. 266\u2013281. 337, 339, 343, 347"},{"key":"25_CR9","unstructured":"Nicolas Courtois: The HFE cryptosystem home page. http:\/\/www.hfe.info"},{"key":"25_CR10","unstructured":"Nicolas Courtois: La s\u00e9curit\u00e9 des primitives cryptographiques bas\u00e9es sur les probl\u00e8mes alg\u00e9briques multivariables MQ, IP, MinRank, et HFE, PhD thesis, Paris 6 University, 2001, in French. Available at http:\/\/www.minrank.org\/phd.pdf . 339, 340, 341, 343, 345"},{"key":"25_CR11","unstructured":"Nicolas Courtois: Generic Attacks and the Security of Quartz, PKC 2003, in these proceedings. A preliminary version was presented at the second Nessie workshop, Royal Holloway, University of London, September 2001. 338, 341, 345"},{"key":"25_CR12","unstructured":"Magnus Daum, Patrick Felke: Some new aspects concerning the Analysis of HFE type Cryptosystems; Presented at Yet Another Conference on Cryptography (YACC\u201902), June 3\u20137, 2002, Porquerolles Island, France. 339, 343"},{"key":"25_CR13","unstructured":"Magnus Daum: Das KryptosystemHFE und quadratische Gleichungssysteme \u00fcber endlichen K\u00f6rpern, Diplomarbeit, Universit\u00e4t Dortmund, 2001. Available from http:\/\/daum@itsc.ruhr-uni-bochum.de 339, 341, 343"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e8re","year":"1999","unstructured":"Jean-Charles Faug\u00e8re: A new efficient algorithm for computing Gr\u00f6bner bases (F4), Journal of Pure and Applied Algebra 139, 1\u20133 (1999) pp. 61\u201388. See http:\/\/www.elsevier.com\/locate\/jpaa 341","journal-title":"Journal of Pure and Applied Algebra"},{"key":"25_CR15","unstructured":"Jean-Charles Faug\u00e8re: Computing Gr\u00f6bner basis without reduction to 0, technical report LIP6, in preparation, source: private communication. Also presented at the Workshop on Applications of Commutative Algebra, Catania, Italy, 3\u20136 April 2002. 337, 339, 341"},{"key":"25_CR16","unstructured":"Jean-Charles Faug\u00e8re: Report on a successful attack of HFE Challege 1 with Gr\u00f6bner bases algorithm F5\/2, announcement that appeared in sci. crypt newsgroup on the internet on April 19th 2002. 337, 339, 341, 347"},{"key":"25_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-46035-7_19","volume-title":"Marine Minier: Cryptanalysis of SFLASH","author":"H. Gilbert","year":"2002","unstructured":"Henri Gilbert, Marine Minier: Cryptanalysis of SFLASH, Eurocrypt 2002, LNCS 2332, pp. 288\u2013298, Springer. 339"},{"key":"25_CR18","unstructured":"G.-M. Greuel, G. Pfister, and H. Sch\u00f6nemann. Singular 2.0.3. A Computer Algebra System for Polynomial Computations. Centre for Computer Algebra, University of Kaiserslautern (2001), http:\/\/www.singular.uni-kl.de . 342"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Neal Koblitz: \u201cAlgebraic Aspects of Cryptography\u201d; Springer-Verlag, ACM3, 1998, Chapter 4: \u201cHidden Monomial Cryptosystems\u201d, pp. 80\u2013102. 348","DOI":"10.1007\/978-3-662-03642-6"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Tsutomu Matsumoto, Hideki Imai: \u201cPublic Quadratic Polynomial-tuples for efficient signature-verification and message-encryption\u201d, Eurocrypt\u201988, Springer-Verlag 1998, pp. 419\u2013453. 337","DOI":"10.1007\/3-540-45961-8_39"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Jacques Patarin: \u201cCryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt\u201988\u201d; Crypto\u201995, Springer-Verlag, pp. 248\u2013261. 337, 345","DOI":"10.1007\/3-540-44750-4_20"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Jacques Patarin: \u201cHidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms\u201d; Eurocrypt\u201996, Springer Verlag, pp. 33\u201348. The extended version can be found at http:\/\/www.minrank.org\/hfe.ps 337, 341, 347","DOI":"10.1007\/3-540-68339-9_4"},{"key":"25_CR23","unstructured":"Jacques Patarin: La CryptographieMultivariable; M\u00e9moire d'habilitation \u00e0 diriger des recherches de l\u2019Universit\u00e9 Paris 7, 1999. 348"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Jacques Patarin, Nicolas Courtois, Louis Goubin: \u201cC*-+ and HM-Variations around two schemes of T. Matsumoto and H. Imai\u201d; Asiacrypt 1998, Springer-Verlag, pp. 35\u201349. 339","DOI":"10.1007\/3-540-49649-1_4"},{"key":"25_CR25","series-title":"Lect Notes Comput Sci","volume-title":"Quartz, 128-bit long digital signatures","author":"J. Patarin","year":"2001","unstructured":"Jacques Patarin, Louis Goubin, Nicolas Courtois: Quartz, 128-bit long digital signatures; Cryptographers\u2019 Track Rsa Conference 2001, San Francisco 8\u201312 April 2001, LNCS2020, Springer-Verlag."},{"key":"25_CR26","unstructured":"Jacques Patarin, Louis Goubin, Nicolas Courtois: Quartz, 128-bit long digital signatures; An updated version of Quartz specification available at http:\/\/www.cryptosystem.net\/quartz\/ 338, 341, 343, 345, 348, 350"},{"key":"25_CR27","unstructured":"Adi Shamir, Aviad Kipnis: \u201cCryptanalysis of the HFE Public Key Cryptosystem\u201d; Crypto\u201999. Can be found at http:\/\/www.minrank.org\/hfesubreg.ps 337, 338, 343"},{"key":"25_CR28","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Volker Strassen: Gaussian Elimination is Not Optimal; Numerische Mathematik, vol 13, pp 354\u2013356, 1969. 346","journal-title":"Numerische Mathematik"},{"key":"25_CR29","unstructured":"Nicolas Courtois, Magnus Daum and Patrick Felke: On the Security of HFE, HFEv-and Quartz; Cryptology ePrint Archive, Report 2002\/138. Available at http:\/\/eprint.iacr.org . 342, 343, 344, 347"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:56:33Z","timestamp":1556456193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}