{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T18:03:54Z","timestamp":1764698634813},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345466"},{"type":"electronic","value":"9783540345473"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11761679_3","type":"book-chapter","created":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T14:11:19Z","timestamp":1152022279000},"page":"30-47","source":"Crossref","is-referenced-by-count":53,"title":["Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"first","affiliation":[]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Adams, W.W., Loustaunau, P.: An Introduction to Gr\u00f6bner Bases, vol. 3. AMS. Graduate Studies in Mathematics\u00a03 (1994)","DOI":"10.1090\/gsm\/003"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-30539-2_24","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"G. Ars","year":"2004","unstructured":"Ars, G., Faug\u00e8re, J.-C., Imai, H., Kawazoe, M., Sugita, M.: Comparison Between XL and Gr\u00f6bner Basis Algorithms. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 338\u2013353. Springer, Heidelberg (2004)"},{"key":"3_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: MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry, 15 pages (2005)"},{"key":"3_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. of International Conference on Polynomial System Solving (ICPSS), pp. 71\u201375 (2004)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-40061-5_21","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"O. Billet","year":"2003","unstructured":"Billet, O., Gilbert, H.: A Traceable Block Cipher. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 331\u2013346. Springer, Heidelberg (2003)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-39200-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"A. Biryukov","year":"2003","unstructured":"Biryukov, A., De Canni\u00e8re, C., Braeken, A., Preneel, B.: A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 33\u201350. Springer, Heidelberg (2003)"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R.B. Boppana","year":"1987","unstructured":"Boppana, R.B., Hastad, J., Zachos, S.: Does co\u2013NP Have Short Interactive Proofs? Information Processing Letters\u00a025(2), 127\u2013132 (1987)","journal-title":"Information Processing Letters"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Gr\u00f6bner Bases: 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":"3_CR9","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":"3_CR10","unstructured":"Courtois, N.: La s\u00e9curit\u00e9 des primitives cryptographiques bas\u00e9es sur des probl\u00e8mes alg\u00e9briques multivariables: MQ, IP, MinRank, HFE. Ph.D. Thesis, Paris (2001)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0054126","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"N. Courtois","year":"1998","unstructured":"Courtois, N., Goubin, L., Patarin, J.: Improved Algorithms for Isomorphism of Polynomials. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 184\u2013200. Springer, Heidelberg (1998)"},{"key":"3_CR12","unstructured":"Courtois, N., Goubin, L., Patarin, J.: Improved Algorithms for Isomorphism of Polynomials - (extended Version), available from: http:\/\/www.minrank.org"},{"key":"3_CR13","unstructured":"Courtois, N., Goubin, L., Patarin, J.: SFLASH, a Fast Asymmetric Signature Scheme for low-cost Smartcards \u2013 Primitive Specification and Supporting Documentation, available at: http:\/\/www.minrank.org\/sflash-b-v2.pdf"},{"key":"3_CR14","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":"3_CR15","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"publisher","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)"},{"issue":"1-3","key":"3_CR16","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 (F 4). Journal of Pure and Applied Algebra\u00a0139(1-3), 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"3_CR17","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)"},{"key":"3_CR18","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":"4","key":"3_CR19","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 Bases by Change of Ordering. Journal of Symbolic Computation\u00a016(4), 329\u2013344 (1993)","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11779360_19","volume-title":"Coding and Cryptography","author":"P. Felke","year":"2006","unstructured":"Felke, P.: On certain Families of HFE-type Cryptosystems. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 229\u2013241. Springer, Heidelberg (2006)"},{"key":"3_CR21","unstructured":"Fortin, S.: The Graph Isomorphism problem. Technical Report 96-20, University of Alberta (1996)"},{"key":"3_CR22","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":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45325-3_31","volume-title":"Cryptography and Coding","author":"W. Geiselmann","year":"2001","unstructured":"Geiselmann, W., Steinwandt, R., Beth, T.: Attacking the Affine Parts of SFLASH. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol.\u00a02260, pp. 355\u2013359. Springer, Heidelberg (2001)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-11493-9","volume-title":"Group-theoretic algorithms and Graph Isomorphism","author":"M. Hoffman","year":"1982","unstructured":"Hoffman, M.: Group-Theoretic Algorithms and Graph Isomorphism. LNCS, vol.\u00a0136. Springer, Heidelberg (1982)"},{"key":"3_CR25","unstructured":"http:\/\/magma.maths.usyd.edu.au\/magma\/"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"3_CR27","unstructured":"https:\/\/www.cosic.esat.kuleuven.be\/nessie\/deliverables\/decision-final.pdf"},{"key":"3_CR28","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 - 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":"3_CR29","unstructured":"Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms \u2013 (extended Version), available from: http:\/\/www.minrank.org\/hfe\/"},{"key":"3_CR30","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 1988. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 248\u2013261. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11761679_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T22:58:16Z","timestamp":1683500296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11761679_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345466","9783540345473"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11761679_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}