{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T05:16:45Z","timestamp":1790745405138,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642173721","type":"print"},{"value":"9783642173738","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17373-8_32","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T15:22:55Z","timestamp":1291303375000},"page":"557-576","source":"Crossref","is-referenced-by-count":29,"title":["The Degree of Regularity of HFE Systems"],"prefix":"10.1007","author":[{"given":"Vivien","family":"Dubois","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Gama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Bardet, M.: \u00c9tude des syst\u00e9mes alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e1la cryptographie. PhD thesis, Universit\u00e9Paris 6 (2004)"},{"key":"32_CR2","unstructured":"Bardet, M., Faug\u00e9re, J.-C., Salvy, B.: On the Complexity of Gr\u00f6bner Basis Computation of Semi-Regular Overdetermined Algebraic Equations. In: ICPSS International Conference on Polynomial System Solving (2004)"},{"key":"32_CR3","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassnringes nach einem nulldimensionalen Polynomideal. PhD thesis, Innsbruck (1965)"},{"key":"32_CR4","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. Courtois","year":"2001","unstructured":"Courtois, N.: The Security of Hidden Field Equations (HFE). In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 266\u2013281. Springer, Heidelberg (2001)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"N. Courtois","year":"2000","unstructured":"Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 392\u2013407. Springer, Heidelberg (2000)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-30539-2_23","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"C. Diem","year":"2004","unstructured":"Diem, C.: The xl-algorithm and a conjecture from commutative algebra. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 323\u2013337. Springer, Heidelberg (2004)"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-540-85886-7_15","volume-title":"Information Security","author":"J. Ding","year":"2008","unstructured":"Ding, J., Schmidt, D., Werner, F.: Algebraic attack on hfe revisited. In: Wu, T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol.\u00a05222, pp. 215\u2013227. Springer, Heidelberg (2008)"},{"key":"32_CR8","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":"32_CR9","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)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e9re","year":"1999","unstructured":"Faug\u00e9re, J.-C.: A New Efficient Algorithm for Computing Gr\u00f6bner Bases (F4). Journal of Pure and Applied Algebra\u00a0139, 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Faug\u00e9re, J.-C.: A New Efficient Algorithm for Computing Gr\u00f6bner Bases without Reductions to Zero F5. In: ISSAC, pp. 75\u201383 (2002)","DOI":"10.1145\/780506.780516"},{"key":"32_CR12","unstructured":"Faug\u00e9re, J.-C.: Algebraic Cryptanalysis of HFE using Gr\u00f6bner Bases. Technical Report 4738, INRIA (2003)"},{"key":"32_CR13","unstructured":"Kunz-Jacques, S.: Preuves de s\u00e9curit\u00e9 et probl\u00e9mes difficiles en cryptologie: \u00e9tude de cas. PhD thesis, Universit\u00e9 Paris 7 (2007)"},{"key":"32_CR14","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)"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/11818175_20","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"L. Granboulan","year":"2006","unstructured":"Granboulan, L., Joux, A., Stern, J.: Inverting HFE Is Quasipolynomial. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 345\u2013356. Springer, Heidelberg (2006)"},{"key":"32_CR16","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":"32_CR17","unstructured":"Steel, A.: Allan Steel\u2019s Groebner Basis Timings Page (2004), magma.maths.usyd.edu.au\/users\/allan\/gb"},{"key":"32_CR18","unstructured":"University of Sydney Computational Algebra Group. The MAGMA Computational Algebra System"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11496618_7","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B.-Y. Yang","year":"2005","unstructured":"Yang, B.-Y., Chen, J.-M.: All in the xl family: Theory and practice. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 67\u201386. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17373-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:52:54Z","timestamp":1606186374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17373-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642173721","9783642173738"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17373-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}