{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T11:42:29Z","timestamp":1769686949096,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540374329","type":"print"},{"value":"9783540374336","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_20","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T02:21:52Z","timestamp":1158978112000},"page":"345-356","source":"Crossref","is-referenced-by-count":30,"title":["Inverting HFE Is Quasipolynomial"],"prefix":"10.1007","author":[{"given":"Louis","family":"Granboulan","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Joux","sequence":"additional","affiliation":[]},{"given":"Jacques","family":"Stern","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Bardet, M.: \u00c9tude des syst\u00e8mes alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e0 la cryptographie. PhD thesis, Universit\u00e8 Paris (December 6, 2004), http:\/\/www-calfor.lip6.fr\/~bardet\/"},{"key":"20_CR2","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B.: On the complexity of Gr\u00f6bner basis computation of semi-regular overdetermined algebraic equations. In: Proc. ICPSS International Conference on Polynomial System Solving (2004)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"20_CR4","unstructured":"Buchberger, B.: Gr\u00f6bner bases: an algorithmic method in polynomial ideal theory. In: Bose, N.-K. (ed.) Multidimensional systems theory, number\u00a016 in Mathematics and its Applications, ch. 6, pp. 184\u2013232. D. Reidel Pub. Co., 1985; Based on his PhD thesis: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, U. Innsbruck, Austria (1965)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-45353-9_20","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"N.T. Courtois","year":"2001","unstructured":"Courtois, N.T.: The Security of Hidden Field Equations (HFE). In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 266\u2013281. Springer, Heidelberg (2001)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11787006_14","volume-title":"Automata, Languages and Programming","author":"V. Dubois","year":"2006","unstructured":"Dubois, V., Granboulan, L., Stern, J.: An efficient provable distinguisher for HFE. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 156\u2013167. Springer, Heidelberg (2006)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-45146-4_3","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J.-C. Faug\u00e8re","year":"2003","unstructured":"Faug\u00e8re, J.-C., Joux, A.: Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gr\u00f6bner Bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 44\u201360. Springer, Heidelberg (2003)"},{"issue":"1-3","key":"20_CR8","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":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra\u00a0139(1-3), 61\u201388 (1999); Effective methods in algebraic geometry (Saint-Malo, 1998)","journal-title":"J. Pure Appl. Algebra"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Mora, T. (ed.) ISSAC 2002, pp. 75\u201383 (2002)","DOI":"10.1145\/780506.780516"},{"key":"20_CR10","unstructured":"Faug\u00e8re, J.-C.: Algebraic cryptanalysis of HFE using Gr\u00f6bner bases. Technical Report 4738, INRIA (February 2003), ftp:\/\/ftp.inria.fr\/INRIA\/tech-reports\/dienst\/RR-4738.pdf"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/11426639_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P.-A. Fouque","year":"2005","unstructured":"Fouque, P.-A., Granboulan, L., Stern, J.: Differential Cryptanalysis for Multivariate Schemes. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03386, pp. 341\u2013353. Springer, Heidelberg (2005)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"A. Kipnis","year":"1999","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 19\u201330. Springer, Heidelberg (1999)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-12868-9_99","volume-title":"Computer Algebra","author":"D. Lazard","year":"1983","unstructured":"Lazard, D.: Gr\u00f6bner bases, gaussian elimination and resolution of systems of algebraic equations. In: van Hulzen, J.A. (ed.) ISSAC 1983 and EUROCAL 1983. LNCS, vol.\u00a0162, pp. 146\u2013156. Springer, Heidelberg (1983)"},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/569746.569750","volume":"35","author":"D. Lazard","year":"2001","unstructured":"Lazard, D.: Solving systems of algebraic equations. ACM SIGSAM Bulletin\u00a035(3), 11\u201337 (2001)","journal-title":"ACM SIGSAM Bulletin"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/3-540-45961-8_39","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"T. Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 419\u2013453. Springer, Heidelberg (1988)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-44750-4_20","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"J. Patarin","year":"1995","unstructured":"Patarin, J.: Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt \u201988. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 248\u2013261. Springer, Heidelberg (1995)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J. Patarin","year":"1996","unstructured":"Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 33\u201348. Springer, Heidelberg (1996)"},{"key":"20_CR18","unstructured":"Wolf, C., Preneel, B.: Taxonomy of Public Key Schemes based on the problem of Multivariate Quadratic equations. Cryptology ePrint Archive, Report 2005\/077 (2005), http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:16:08Z","timestamp":1605626168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11818175_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}