{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T21:51:40Z","timestamp":1774907500717,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319790626","type":"print"},{"value":"9783319790633","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-79063-3_18","type":"book-chapter","created":{"date-parts":[[2018,3,31]],"date-time":"2018-03-31T14:23:38Z","timestamp":1522506218000},"page":"375-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Improved Cryptanalysis of HFEv- via Projection"],"prefix":"10.1007","author":[{"given":"Jintai","family":"Ding","sequence":"first","affiliation":[]},{"given":"Ray","family":"Perlner","sequence":"additional","affiliation":[]},{"given":"Albrecht","family":"Petzoldt","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Smith-Tone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,1]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-48910-X_15","volume-title":"Advances in Cryptology\u2014EUROCRYPT \u201999","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Patarin, J., Goubin, L.: Unbalanced oil and vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 206\u2013222. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_15"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11496137_12","volume-title":"Applied Cryptography and Network Security","author":"J Ding","year":"2005","unstructured":"Ding, J., Schmidt, D.: Rainbow, a new multivariable polynomial signature scheme. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 164\u2013175. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_12"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-45353-9_21","volume-title":"Topics in Cryptology\u2014CT-RSA 2001","author":"J Patarin","year":"2001","unstructured":"Patarin, J., Courtois, N., Goubin, L.: QUARTZ, 128-bit long digital signatures. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 282\u2013297. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_21"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1515\/JMC.2009.009","volume":"3","author":"L Bettale","year":"2009","unstructured":"Bettale, L., Faug\u00e8re, J.C., Perret, L.: Hybrid approach for solving multivariate systems over finite fields. J. Math. Cryptol. 3, 177\u2013197 (2009)","journal-title":"J. Math. Cryptol."},{"key":"18_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology\u2014EUROCRYPT \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. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_4"},{"key":"18_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. 2729, pp. 44\u201360. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_3"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology\u2014CRYPTO \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. 1666, pp. 19\u201330. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_2"},{"key":"18_CR9","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\u2014EUROCRYPT 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. 1807, pp. 392\u2013407. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_27"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faugere","year":"1999","unstructured":"Faugere, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139, 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Faugere, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (f5). In: ISSAC 2002, pp. 75\u201383. ACM Press (2002)","DOI":"10.1145\/780506.780516"},{"key":"18_CR12","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-23141-4_12","volume-title":"Information Security and Assurance","author":"MSE Mohamed","year":"2011","unstructured":"Mohamed, M.S.E., Ding, J., Buchmann, J.: Towards algebraic cryptanalysis of HFE challenge 2. In: Kim, T., Adeli, H., Robles, R.J., Balitanas, M. (eds.) ISA 2011. CCIS, vol. 200, pp. 123\u2013131. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23141-4_12"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-642-22792-9_41","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J Ding","year":"2011","unstructured":"Ding, J., Hodges, T.J.: Inverting HFE systems is quasi-polynomial for all fields. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 724\u2013742. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_41"},{"key":"18_CR14","unstructured":"Ding, J., Kleinjung, T.: Degree of regularity for HFE-. IACR Cryptology ePrint Archive 2011, 570 (2011)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-38616-9_4","volume-title":"Post-Quantum Cryptography","author":"J Ding","year":"2013","unstructured":"Ding, J., Yang, B.-Y.: Degree of regularity for HFEv and HFEv-. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 52\u201366. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_4"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-012-9617-2","volume":"69","author":"L Bettale","year":"2013","unstructured":"Bettale, L., Faug\u00e8re, J., Perret, L.: Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic. Des. Codes Cryptogr. 69, 1\u201352 (2013)","journal-title":"Des. Codes Cryptogr."},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-11659-4_14","volume-title":"Post-Quantum Cryptography","author":"J Porras","year":"2014","unstructured":"Porras, J., Baena, J., Ding, J.: ZHFE, a new multivariate public key encryption scheme. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 229\u2013245. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_14"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Cabarcas, D., Smith-Tone, D., Verbel, J.A.: Key recovery attack for ZHFE. [22], pp. 289\u2013308 (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_17","DOI":"10.1007\/978-3-319-59879-6_17"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Vates, J., Smith-Tone, D.: Key recovery attack for all parameters of HFE-. [22], pp. 272\u2013288 (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_16","DOI":"10.1007\/978-3-319-59879-6_16"},{"key":"18_CR20","unstructured":"Petzoldt, A.: On the complexity of the hybrid approach on HFEv-. Cryptology ePrint Archive, Report 2017\/1135 (2017). https:\/\/eprint.iacr.org\/2017\/1135"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-27800-9_24","volume-title":"Information Security and Privacy","author":"B-Y Yang","year":"2004","unstructured":"Yang, B.-Y., Chen, J.-M.: Theoretical analysis of XL over small fields. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 277\u2013288. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27800-9_24"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59879-6","volume-title":"Post-Quantum Cryptography","year":"2017","unstructured":"Lange, T., Takagi, T. (eds.): PQCrypto 2017. LNCS, vol. 10346. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-79063-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T08:53:25Z","timestamp":1751532805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-79063-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319790626","9783319790633"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-79063-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"1 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fort Lauderdale","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.fau.edu\/pqcrypto2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}