{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:56:48Z","timestamp":1779901008971,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540235637","type":"print"},{"value":"9783540301912","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30191-2_31","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T20:14:16Z","timestamp":1285186456000},"page":"401-413","source":"Crossref","is-referenced-by-count":38,"title":["On Asymptotic Security Estimates in XL and Gr\u00f6bner Bases-Related Algebraic Cryptanalysis"],"prefix":"10.1007","author":[{"given":"Bo-Yin","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiun-Ming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas T.","family":"Courtois","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Anonymous Referee Report from Crypto 2004 (2004)"},{"key":"31_CR2","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B.: Complexity of Gr\u00f6bner Basis Computations for Regular Overdetermined Systems, inria rr-5049"},{"key":"31_CR3","unstructured":"Bernstein, D.: Matrix Inversion Made Difficult, preprint at http:\/\/cr.yp.to"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1017\/S0305004100032655","volume":"53","author":"C. Chester","year":"1957","unstructured":"Chester, C., Friedman, B., Ursell, F.: An Extension of the Method of Steepest Descents. Proc. Camb. Philo. Soc.\u00a053, 599\u2013611 (1957)","journal-title":"Proc. Camb. Philo. Soc."},{"key":"31_CR5","unstructured":"Coppersmith, D.: Private communication"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via Arithmetic Progressions. J. Symbolic Computation\u00a09, 251\u2013280 (1990)","journal-title":"J. Symbolic Computation"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-36552-4_13","volume-title":"Information Security and Cryptology - ICISC 2002","author":"N. Courtois","year":"2003","unstructured":"Courtois, N.: Higher-Order Correlation Attacks, XL Algorithm and Cryptanalysis of Toyocrypt. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 182\u2013199. Springer, Heidelberg (2003)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-45146-4_11","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"N. Courtois","year":"2003","unstructured":"Courtois, N.: Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 177\u2013194. Springer, Heidelberg (2003)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-24632-9_15","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"N. Courtois","year":"2004","unstructured":"Courtois, N.: Algebraic Attacks over GF(2k), Cryptanalysis of HFE Challenge 2 and SFLASHv2. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 201\u2013217. Springer, Heidelberg (2004)"},{"key":"31_CR10","unstructured":"Courtois, N., Goubin, L., Patarin, J.: SFLASHv3, a Fast Asymmetric Signature Scheme, preprint available at http:\/\/eprint.iacr.org\/2003\/211"},{"key":"31_CR11","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":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-36563-X_10","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"N. Courtois","year":"2003","unstructured":"Courtois, N., Patarin, J.: About the XL Algorithm over GF(2). In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 141\u2013157. Springer, Heidelberg (2003)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-36178-2_17","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"N. Courtois","year":"2002","unstructured":"Courtois, N., Pieprzyk, J.: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 267\u2013287. Springer, Heidelberg (2002)"},{"key":"31_CR14","volume-title":"The Design of Rijndael, AES - The Advanced Encryption Standard","author":"J. Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael, AES - The Advanced Encryption Standard. Springer, Heidelberg (2002)"},{"key":"31_CR15","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) (to appear)"},{"key":"31_CR16","volume-title":"Direct Methods for Sparse Matrices","author":"S. Duff","year":"1986","unstructured":"Duff, S., Erismann, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Oxford Science Publications, Oxford (1986)"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1145\/258726.258776","volume-title":"Proc. ISSAC 1997","author":"W. Eberly","year":"1997","unstructured":"Eberly, W., Kaltofen, E.: On Randomized Lanczos Algorithms. In: Proc. ISSAC 1997, pp. 176\u2013183. ACM Press, New York (1997)"},{"key":"31_CR18","volume-title":"Commutative Algebra with a View toward Algebraic Geometry","author":"D. Eisenbud","year":"1995","unstructured":"Eisenbud, D.: Commutative Algebra with a View toward Algebraic Geometry. Springer, Heidelberg (1995)"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"Proceedings of ISSAC 2002","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: Proceedings of ISSAC 2002, pp. 75\u201383. ACM Press, New York (2002)"},{"key":"31_CR20","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 Equations (HFE) Cryptosystems Using Gr\u00f6bner Bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 44\u201360. Springer, Heidelberg (2003)"},{"key":"31_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.7146\/math.scand.a-12092","volume":"56","author":"R. Fr\u00f6berg","year":"1985","unstructured":"Fr\u00f6berg, R.: An inequality for Hilbert Series of Graded Algebras. Math. Scand.\u00a056, 117\u2013144 (1985)","journal-title":"Math. Scand."},{"key":"31_CR22","volume-title":"Computers and Intractability, A Guide to the Theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-completeness. W. H. Freeman, New York (1979)"},{"issue":"4","key":"31_CR23","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1111\/1467-9590.00065","volume":"99","author":"H.-K. Hwang","year":"1997","unstructured":"Hwang, H.-K.: Asymptotic estimates of elementary probability distributions. Studies in Applied Mathematics\u00a099(4), 393\u2013417 (1997)","journal-title":"Studies in Applied Mathematics"},{"key":"31_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-38424-3_8","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"B. LaMacchia","year":"1991","unstructured":"LaMacchia, B., Odlyzko, A.: Solving Large Sparse Linear Systems over Finite Fields. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 109\u2013133. Springer, Heidelberg (1991)"},{"key":"31_CR25","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":"31_CR26","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":"31_CR27","doi-asserted-by":"crossref","unstructured":"McGeoch, C.: Veni, Divisi, Vici. Appearing in the \u201cComputer Science Sampler. column of the Amer. Math. Monthly (May 1995)","DOI":"10.2307\/2975039"},{"key":"31_CR28","unstructured":"Moh, T.: On The Method of XL and Its Inefficiency Against TTM, Available at http:\/\/eprint.iacr.org\/2001\/047"},{"key":"31_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45708-9_1","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"S. Murphy","year":"2002","unstructured":"Murphy, S., Robshaw, M.: Essential Algebraic Structures Within the AES. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 1\u201316. Springer, Heidelberg (2002)"},{"key":"31_CR30","unstructured":"Murphy, S., Robshaw, M.: Comments on the Security of the AES and the XSL Technique, From author\u2019s homepage http:\/\/www.isg.rhul.ac.uk\/~sean\/"},{"key":"31_CR31","unstructured":"NESSIE Security Report, V2.0, Available at http:\/\/www.cryptonessie.org"},{"key":"31_CR32","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 Field 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":"31_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-49649-1_4","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"J. Patarin","year":"1998","unstructured":"Patarin, J., Goubin, L., Courtois, N.: C\u2217 \u2212+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 35\u201349. Springer, Heidelberg (1998)"},{"key":"31_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-45353-9_22","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"J. Patarin","year":"2001","unstructured":"Patarin, J., Courtois, N., Goubin, L.: FLASH, a Fast Multivariate Signature Algorithm. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 298\u2013307. Springer, Heidelberg (2001), Update with SFLASHv2 available at http:\/\/www.cryptonessie.org"},{"key":"31_CR35","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian Elimination is not Optimal. Num. Math.\u00a013, 354\u2013356 (1969)","journal-title":"Num. Math."},{"key":"31_CR36","unstructured":"Sugita, M., Kawazoe, M., Imai, H.: Relation between XL algorithm and Groebner Bases Algorithms (preprint), http:\/\/eprint.iacr.org\/2004\/112"},{"key":"31_CR37","unstructured":"Szeg\u00f6, G.: Orthogonal Polynomials, 4th edn. Amer. Math. Soc., Providence"},{"issue":"1","key":"31_CR38","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"IT-32","author":"D. Wiedemann","year":"1976","unstructured":"Wiedemann, D.: Solving Sparse Linear Equations over Finite Fields. IEEE Transaction on Information Theory\u00a0IT-32(1), 54\u201362 (1976)","journal-title":"IEEE Transaction on Information Theory"},{"key":"31_CR39","volume-title":"Asymptotic Approximations of Integrals","author":"R. Wong","year":"1989","unstructured":"Wong, R.: Asymptotic Approximations of Integrals. Acad. Press, San Diego (1989)"},{"key":"31_CR40","unstructured":"Yang, B.-Y., Chen, J.-M.: All in the XL Family: Theory and Practice (preprint)"},{"key":"31_CR41","unstructured":"Yang, B.-Y., Chen, J.-M.: TTS: Rank Attacks in Tame-Like Multivariate PKCs, Available at http:\/\/eprint.iacr.org\/2004\/061"},{"key":"31_CR42","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.\u00a03108, pp. 277\u2013288. Springer, Heidelberg (2004); Note: updated version available from the authors"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30191-2_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:46:34Z","timestamp":1605761194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30191-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540235637","9783540301912"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30191-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}