{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T18:11:18Z","timestamp":1760983878793},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642193781"},{"type":"electronic","value":"9783642193798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19379-8_29","type":"book-chapter","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T12:29:44Z","timestamp":1298982584000},"page":"473-493","source":"Crossref","is-referenced-by-count":17,"title":["Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem"],"prefix":"10.1007","author":[{"given":"Charles","family":"Bouillaguet","sequence":"first","affiliation":[]},{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"additional","affiliation":[]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-88403-3_2","volume-title":"Post-Quantum Cryptography","author":"J. Baena","year":"2008","unstructured":"Baena, J., Clough, C., Ding, J.: Square-vinegar signature scheme. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol.\u00a05299, pp. 17\u201330. Springer, Heidelberg (2008)"},{"key":"29_CR2","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, Porto Conte, Alghero, Sardinia (Italy), May 27-June 1 (2005)"},{"key":"29_CR3","unstructured":"Bardet, M.: \u00c9tude des syst\u00e8mes alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e0 la cryptographie. PhD thesis, Universit\u00e9 de Paris VI (2004)"},{"key":"29_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)"},{"key":"29_CR5","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":"29_CR6","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1090\/S0002-9904-1919-03224-8","volume":"25","author":"A.A. Bennett","year":"1919","unstructured":"Bennett, A.A.: Products of skew-symmetric matrices. American M. S. Bull.\u00a025, 455\u2013458 (1919)","journal-title":"American M. S. Bull."},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1515\/9781400833344","volume-title":"Matrix mathematics. Theory, facts, and formulas","author":"D.S. Bernstein","year":"2009","unstructured":"Bernstein, D.S.: Matrix mathematics. Theory, facts, and formulas, 2nd expanded edn., vol.\u00a0xxxix, p. 1139. Princeton University Press, Princeton (2009)","edition":"2"},{"key":"29_CR8","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)"},{"issue":"3\/4","key":"29_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J.J., Playoust, C.: The Magma Algebra System I: The User Language. J. Symb. Comput.\u00a024(3\/4), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02940714","volume":"11","author":"C. Chevalley","year":"1935","unstructured":"Chevalley, C.: D\u00e9monstration d\u2019une hypoth\u00e8se de M. Artin. Abh. Math. Semin. Hamb. Univ.\u00a011, 73\u201375 (1935)","journal-title":"Abh. Math. Semin. Hamb. Univ."},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-00862-7_17","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"C. Clough","year":"2009","unstructured":"Clough, C., Baena, J., Ding, J., Yang, B.-Y., Chen, M.-s.: Square, a new multivariate encryption scheme. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol.\u00a05473, pp. 252\u2013264. Springer, Heidelberg (2009)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-71677-8_18","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"J. Ding","year":"2007","unstructured":"Ding, J., Wolf, C., Yang, B.-Y.: \u2113-invertible cycles for multivariate quadratic public key cryptography. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 266\u2013281. Springer, Heidelberg (2007)"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-24582-7_18","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"F.L. dit Vehel","year":"2003","unstructured":"dit Vehel, F.L., Perret, L.: Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol.\u00a02904, pp. 235\u2013251. Springer, Heidelberg (2003)"},{"issue":"4","key":"29_CR14","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"},{"issue":"1-3","key":"29_CR15","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). Journal of Pure and Applied Algebra\u00a0139(1-3), 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"ISSAC 2002: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation","author":"J.-C. Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re, J.-C.: A New Efficient Algorithm for Computing Gr\u00f6bner Bases Without Reduction to Zero (F5). In: ISSAC 2002: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp. 75\u201383. ACM, New York (2002)"},{"key":"29_CR17","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":"29_CR18","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"29_CR19","unstructured":"Fortin, S.: The graph isomorphism problem. Technical report, University of Alberta (1996)"},{"key":"29_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8734-1","volume-title":"A polynomial approach to linear algebra","author":"P.A. Fuhrmann","year":"1996","unstructured":"Fuhrmann, P.A.: A polynomial approach to linear algebra. Springer, New York (1996)"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Fulman, J.: Random matrix theory over finite fields. Bull. Amer. Math. Soc. (N.S)\u00a039, 51\u201385","DOI":"10.1090\/S0273-0979-01-00920-X"},{"key":"29_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.S.: Computers and Intractability, A Guide to the Theory of NP Completeness. Freeman, New York (1979)"},{"issue":"1","key":"29_CR23","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10207-003-0025-5","volume":"2","author":"W. Geiselmann","year":"2003","unstructured":"Geiselmann, W., Meier, W., Steinwandt, R.: An Attack on the Isomorphisms of Polynomials Problem with One Secret. Int. J. Inf. Sec.\u00a02(1), 59\u201364 (2003)","journal-title":"Int. J. Inf. Sec."},{"key":"29_CR24","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":"29_CR25","first-page":"174","volume-title":"FOCS","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract). In: FOCS, pp. 174\u2013187. IEEE, Los Alamitos (1986)"},{"key":"29_CR26","first-page":"291","volume-title":"STOC","author":"S. Goldwasser","year":"1985","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC, pp. 291\u2013304. ACM, New York (1985)"},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-48910-X_15","volume-title":"Advances in Cryptology - EUROCRYPT \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.\u00a01592, pp. 206\u2013222. Springer, Heidelberg (1999)"},{"key":"29_CR28","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03642-6","volume-title":"Algebraic Aspects of Cryptography.","author":"N. Koblitz","year":"1998","unstructured":"Koblitz, N.: Algebraic Aspects of Cryptography. Algorithms and Computation in Mathematics, vol.\u00a03. Springer, Heidelberg (1998)"},{"key":"29_CR29","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":"29_CR30","volume-title":"Finite fields","author":"R. Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite fields. Cambridge University Press, New York (1997)"},{"key":"29_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-78440-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"V. Lyubashevsky","year":"2008","unstructured":"Lyubashevsky, V.: Lattice-based identification schemes secure under active attacks. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 162\u2013179. Springer, Heidelberg (2008)"},{"issue":"2","key":"29_CR32","doi-asserted-by":"publisher","first-page":"152","DOI":"10.2307\/2317262","volume":"76","author":"J. MacWilliams","year":"1969","unstructured":"MacWilliams, J.: Orthogonal matrices over finite fields. The American Mathematical Monthly\u00a076(2), 152\u2013164 (1969)","journal-title":"The American Mathematical Monthly"},{"key":"29_CR33","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":"29_CR34","series-title":"Lecture Notes in Computer Science","volume-title":"Topics in Cryptology - CT-RSA 2001","year":"2001","unstructured":"Naccache, D. (ed.): CT-RSA 2001. LNCS, vol.\u00a02020. Springer, Heidelberg (2001)"},{"key":"29_CR35","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":"29_CR36","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), http:\/\/www.minrank.org\/hfe.pdf"},{"key":"29_CR37","unstructured":"Patarin, J.: The Oil and Vinegar signature scheme. Presented at the Dagstuhl Workshop on Cryptography (1997)"},{"key":"29_CR38","doi-asserted-by":"crossref","unstructured":"Patarin, J., Courtois, N., Goubin, L.: Flash, a fast multivariate signature algorithm. In: [34], pp. 298\u2013307","DOI":"10.1007\/3-540-45353-9_22"},{"key":"29_CR39","doi-asserted-by":"crossref","unstructured":"Patarin, J., Courtois, N., Goubin, L.: QUARTZ, 128-Bit Long Digital Signatures. In: [34], pp. 282\u2013297","DOI":"10.1007\/3-540-45353-9_21"},{"key":"29_CR40","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":"J. Patarin","year":"1998","unstructured":"Patarin, J., Goubin, L., Courtois, N.: Improved Algorithms for Isomorphisms of Polynomials. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 184\u2013200. Springer, Heidelberg (1998)"},{"key":"29_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11426639_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"L. Perret","year":"2005","unstructured":"Perret, L.: A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 354\u2013370. Springer, Heidelberg (2005)"},{"key":"29_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/3-540-49264-X_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"D. Pointcheval","year":"1995","unstructured":"Pointcheval, D.: A new identification scheme based on the perceptrons problem. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 319\u2013328. Springer, Heidelberg (1995)"},{"key":"29_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/0-387-34805-0_54","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"A. Shamir","year":"1990","unstructured":"Shamir, A.: An efficient identification scheme based on permuted kernels (extended abstract). In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 606\u2013609. Springer, Heidelberg (1990)"},{"key":"29_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"J. Stern","year":"1994","unstructured":"Stern, J.: A new identification scheme based on syndrome decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 13\u201321. Springer, Heidelberg (1994)"},{"key":"29_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/3-540-48658-5_18","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"J. Stern","year":"1994","unstructured":"Stern, J.: Designing identification schemes with keys of short size. In: Desmedt, Y. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 164\u2013173. Springer, Heidelberg (1994)"},{"key":"29_CR46","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF02940715","volume":"11","author":"E. Warning","year":"1935","unstructured":"Warning, E.: Bemerkung zur vorstehenden Arbeit von Herrn Chevalley.. Abh. Math. Semin. Hamb. Univ.\u00a011, 76\u201383 (1935)","journal-title":"Abh. Math. Semin. Hamb. Univ."},{"key":"29_CR47","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)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19379-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:46:45Z","timestamp":1606168005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19379-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642193781","9783642193798"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19379-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}