{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:26:49Z","timestamp":1778128009589,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540851738","type":"print"},{"value":"9783540851745","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85174-5_16","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T12:32:02Z","timestamp":1219235522000},"page":"280-296","source":"Crossref","is-referenced-by-count":80,"title":["Cryptanalysis of MinRank"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"first","affiliation":[]},{"given":"Fran\u00e7oise","family":"Levy-dit-Vehel","sequence":"additional","affiliation":[]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Adams, W.W., Loustaunau, P.: An Introduction to Gr\u00f6bner Bases. Graduate Studies in Mathematics\u00a03 (1994)","DOI":"10.1090\/gsm\/003"},{"key":"16_CR2","unstructured":"Bardet, M.: \u00c9tude des Syst\u00e8mes Alg\u00e9briques Surd\u00e9termin\u00e9s. Applications aux Codes Correcteurs et \u00e0 la Cryptographie. Th\u00e8se de doctorat, Universit\u00e9 de Paris VI (2004)"},{"key":"16_CR3","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems. In: Proc. of MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry (2005)"},{"key":"16_CR4","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. International Conference on Polynomial System Solving (ICPSS), pp. 71\u201375 (2004), http:\/\/www-calfor.lip6.fr\/ICPSS\/papers\/43BF\/43BF.htm"},{"key":"16_CR5","volume-title":"Computer Algebra Symbolic and Algebraic Computation","author":"B. Buchberger","year":"1982","unstructured":"Buchberger, B., Collins, G.-E., Loos, R.: Computer Algebra Symbolic and Algebraic Computation, 2nd edn. Springer, Heidelberg (1982)","edition":"2"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Gr\u00f6bner Bases\u00a0: an Algorithmic Method in Polynomial Ideal Theory. Recent trends in multidimensional systems theory. Reider ed. Bose (1985)","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"16_CR7","unstructured":"Courtois, N.: Decoding Linear and Rank-Distance Codes, MinRank problem and Multivariate Cryptanalysis. In: CLC 2006, Darmstadt (September 2006)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45682-1_24","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"N. Courtois","year":"2001","unstructured":"Courtois, N.: Efficient Zero-knowledge Authentication Based on a Linear Algebra Problem MinRank. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 402\u2013421. Springer, Heidelberg (2001)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","first-page":"44","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"N. Courtois","year":"2000","unstructured":"Courtois, N., Goubin, L.: Cryptanalysis of the TTM Cryptosystem. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 44\u201357. Springer, Heidelberg (2000)"},{"key":"16_CR10","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, Varieties, and algorithms: an Introduction to Computational Algebraic Geometry and Commutative algebra","author":"D.A. Cox","year":"1992","unstructured":"Cox, D.A., Little, J.B., O\u2019Shea, D.: Ideals, Varieties, and algorithms: an Introduction to Computational Algebraic Geometry and Commutative algebra. Undergraduate Texts in Mathematics. Springer, New York (1992)"},{"key":"16_CR11","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 Basis: F4. Journal of Pure and Applied Algebra\u00a0139, 61\u201368 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"Proceedings of ISSAC","author":"J.-C. Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re, J.-C.: A New Efficient Algorithm for Computing Gr\u00f6bner Basis without Reduction to Zero: F5. In: Proceedings of ISSAC, pp. 75\u201383. ACM press, New York (2002)"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J.-C. Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J.-C., Gianni, P., Lazard, D., Mora, T.: Efficient Computation of Zero-Dimensional Gr\u00f6bner Basis by Change of Ordering. Journal of Symbolic Computation\u00a016(4), 329\u2013344 (1993)","journal-title":"Journal of Symbolic Computation"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 Equations (HFE) Cryptosystems using Gr\u00f6bner Bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 44\u201360. Springer, Heidelberg (2003)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11761679_3","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J.-C. Faug\u00e8re","year":"2006","unstructured":"Faug\u00e8re, J.-C., Perret, L.: Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 30\u201347. Springer, Heidelberg (2006)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-78967-3_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"P.-A. Fouque","year":"2008","unstructured":"Fouque, P.-A., Macario-Rat, G., Stern, J.: Key Recovery on Hidden Monomial Multivariate Schemes. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 19\u201330. Springer, Heidelberg (2008)"},{"key":"16_CR17","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.B.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"16_CR18","unstructured":"Jiang, X., Ding, J., Hu, L.: Kipnis-Shamir\u2019s Attack on HFE Revisited. In: Proc. of Inscrypt 2007 (2007), http:\/\/eprint.iacr.org\/2007\/203"},{"key":"16_CR19","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":"16_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0096-3003(02)00540-4","volume":"146","author":"T. Li","year":"2003","unstructured":"Li, T., Lin, Z., Bai, F.: Heuristic Methods for Computing the Minimal Multi-homogeneous B\u00e9zout Number. Applied Mathematics and Computation\u00a0146, 237\u2013256 (2003)","journal-title":"Applied Mathematics and Computation"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/978-3-540-31856-9_20","volume-title":"STACS 2005","author":"G. Malajovich","year":"2005","unstructured":"Malajovich, G., Meer, K.: Computing Minimal Multi-homogeneous B\u00e9zout Numbers Is Hard. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 244\u2013255. Springer, Heidelberg (2005)"},{"issue":"5","key":"16_CR22","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1080\/00927879908826559","volume":"27","author":"T. Moh","year":"1999","unstructured":"Moh, T.: A Public Key System with Signature and Master Key Functions. Communications in Algebra\u00a027(5), 2207\u20132222 (1999)","journal-title":"Communications in Algebra"},{"key":"16_CR23","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":"16_CR24","unstructured":"Safey El Din, M., Tr\u00e9buchet, P.: Strong bi-homogeneous Bezout theorem and its use in effective real algebraic geometry. INRIA Research Report RR, 46 pages (2006), http:\/\/hal.inria.fr\/inria-00105204"},{"key":"16_CR25","volume-title":"Basic Algebraic Geometry","author":"I.R. Shafarevich","year":"1977","unstructured":"Shafarevich, I.R.: Basic Algebraic Geometry. Springer Study edn. Springer, Berlin (1977)"},{"key":"16_CR26","unstructured":"Shallit, J.O., Frandsen, G.S., Buss, J.F.: The Computational Complexity of some Problems of Linear Algebra. BRICS series report, Aarhus, Denmark, RS-96-33, http:\/\/www.brics.dk\/RS\/96\/33"},{"issue":"1-3","key":"16_CR27","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.jpaa.2003.07.006","volume":"187","author":"H.T. Ha","year":"2004","unstructured":"Ha, H.T., Van Tuyl, A.: The regularity of points in multi-projective spaces. Journal of Pure and Applied Algebra\u00a0187(1-3), 153\u2013167 (2004)","journal-title":"Journal of Pure and Applied Algebra"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85174-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T17:28:59Z","timestamp":1684517339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85174-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851738","9783540851745"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85174-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}