{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T02:33:05Z","timestamp":1783823585357,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262268","type":"print"},{"value":"9783540320838","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496618_7","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T16:27:32Z","timestamp":1279038452000},"page":"67-86","source":"Crossref","is-referenced-by-count":41,"title":["All in the XL Family: Theory and Practice"],"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"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-36288-6_20","volume-title":"Public Key Cryptography - PKC 2003","author":"M. Akkar","year":"2002","unstructured":"Akkar, M., Courtois, N., Duteuil, R., Goubin, L.: A Fast and Secure Implementation of SFLASH. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 267\u2013278. Springer, Heidelberg (2002)"},{"key":"7_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 of XL and Gr\u00f6bner Bases Algorithms over Finite Fields. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 338\u2013353. Springer, Heidelberg (2004)"},{"key":"7_CR3","unstructured":"Bardet, M.: \u00c9tude des syst\u00e8mes alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e0 la cryptographie. Ph.D.\u00a0thesis, Universit\u00e9 Paris 6 (2004)"},{"key":"7_CR4","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B.: Complexity of Gr\u00f6bner Basis Computations for Regular Overdetermined Systems, INRIA Rapport de Recherche No.\u00a05049; a slightly modified preprint is accepted by the International Conference on Polynomial System Solving"},{"key":"7_CR5","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic Complexity of Gr\u00f6bner Basis Algorithms for Semi-regular Overdetermined Systems over Large Fields (manuscript)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1006\/jsco.1994.1061","volume":"18","author":"B. Barkee","year":"1994","unstructured":"Barkee, B., et al.: Why You Cannot Even Hope to Use Gr\u00f6bner Bases in Public-Key Cryptography. J. Symbolic Computations\u00a018, 497\u2013501 (1994)","journal-title":"J. Symbolic Computations"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1090\/S0025-5718-1974-0331751-8","volume":"24","author":"J.R. Bunch","year":"1974","unstructured":"Bunch, J.R., Hopcroft, J.E.: Triangular Factorizations and Inversion by Fast Matrix Multiplication. Math. Computations\u00a024, 231\u2013236 (1974)","journal-title":"Math. Computations"},{"key":"7_CR8","unstructured":"Burden, R., Faires, J.D.: Numerical Analysis, 7th edn. PWS-Kent Publ. Co. (2000)"},{"key":"7_CR9","unstructured":"Bernstein, D.: Matrix Inversion Made Difficult, preprint, stated to be superseded by a yet unpublished version, available at \n                    \n                      http:\/\/cr.yp.to"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/3-540-51083-4_54","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"L. Caniglia","year":"1989","unstructured":"Caniglia, L., Galligo, A., Heintz, J.: Some New Effectivity Bounds in Computational Geometry. In: Mora, T. (ed.) AAECC 1988. LNCS, vol.\u00a0357, pp. 131\u2013151. Springer, Heidelberg (1989)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(91)90105-6","volume":"33","author":"L. Caniglia","year":"1991","unstructured":"Caniglia, L., Galligo, A., Heintz, J.: Equations for the Projective Closure and Effective Nullstellensatz. Discrete Applied Mathematics\u00a033, 11\u201323 (1991)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR12","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":"7_CR13","unstructured":"Coppersmith, D.: Private communication"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-45353-9_20","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"N. Courtois","year":"2001","unstructured":"Courtois, N.: The Security of Hidden Field Equations (HFE). In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 266\u2013281. Springer, Heidelberg (2001)"},{"key":"7_CR15","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":"7_CR16","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.T. Courtois","year":"2003","unstructured":"Courtois, N.T.: 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":"7_CR17","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(2\n                    k\n                  ), application to HFE challenge 2 and sflash-v2. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 201\u2013217. Springer, Heidelberg (2004)"},{"key":"7_CR18","unstructured":"Courtois, N.: Private communication"},{"key":"7_CR19","unstructured":"Courtois, N., Goubin, L., Patarin, J.: SFLASHv3, a Fast Asymmetric Signature Scheme, preprint, available at \n                    \n                      http:\/\/eprint.iacr.org\/2003\/211"},{"key":"7_CR20","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":"7_CR21","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.T. Courtois","year":"2002","unstructured":"Courtois, N.T., 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":"7_CR22","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.T. Courtois","year":"2003","unstructured":"Courtois, N.T., 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":"7_CR23","doi-asserted-by":"crossref","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael, AES - The Advanced Encryption Standard. Springer, Heidelberg (2002)","DOI":"10.1007\/978-3-662-04722-4"},{"key":"7_CR24","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) private communication"},{"issue":"6","key":"7_CR25","first-page":"644","volume":"IT-22","author":"W. Diffie","year":"1972","unstructured":"Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Trans.\u00a0Info.\u00a0Theory\u00a0IT-22(6), 644\u2013654 (1972)","journal-title":"IEEE Trans.\u00a0Info.\u00a0Theory"},{"key":"7_CR26","unstructured":"Ding, J., Schmidt, D.: Cryptanalysis of SFlashv3, \n                    \n                      eprint.iacr.org\/2004\/103"},{"key":"7_CR27","unstructured":"Duff, I.S., Erismann, A.M., Reid, J.K.: Direct Methods for Sparse Matrices, published by Oxford Science Publications (1986)"},{"key":"7_CR28","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":"7_CR29","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e9re","year":"1999","unstructured":"Faug\u00e9re, J.-C.: A New Efficient Algorithm for Computing Gr\u00f6bner Bases (F4). Journal of Pure and Applied Algebra\u00a0139, 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"7_CR30","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":"7_CR31","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)"},{"key":"7_CR32","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":"7_CR33","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)"},{"key":"7_CR34","unstructured":"Geiselmann, W., Steinwandt, R., Beth, T.: Revealing 441 Key Bits of sflashv2. In: 3rd NESSIE Workshop (2002)"},{"issue":"4","key":"7_CR35","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":"7_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3849-0","volume-title":"Algebraic Geometry","author":"R. Hartshorne","year":"1977","unstructured":"Hartshorne, R.: Algebraic Geometry. Springer, Heidelberg (1977)"},{"key":"7_CR37","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":"7_CR38","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":"7_CR39","volume-title":"Algebra","author":"S. Lang","year":"1993","unstructured":"Lang, S.: Algebra, 3rd edn. Addison-Wesley, Reading (1993)","edition":"3"},{"key":"7_CR40","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.) EUROCAL 1983. LNCS, vol.\u00a0162, pp. 146\u2013156. Springer, Heidelberg (1983)"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"McGeoch, C.: \u201cVeni, Divisi, Vici\u201d. Appearing in the \u201cComputer Science Sampler\u201d column of the Amer. Math. Monthly (May 1995)","DOI":"10.2307\/2975039"},{"key":"7_CR42","unstructured":"The MAGMA project, University of Sydney, see \n                    \n                      http:\/\/magma.maths.usyd.edu.au\/users\/allan\/gb"},{"key":"7_CR43","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":"7_CR44","unstructured":"Moh, T.: On The Method of XL and Its Inefficiency Against TTM, available at \n                    \n                      http:\/\/eprint.iacr.org\/2001\/047"},{"key":"7_CR45","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 structure within the AES. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 1\u201316. Springer, Heidelberg (2002)"},{"key":"7_CR46","unstructured":"Murphy, S., Robshaw, M.: Comments on the Security of the AES and the XSL Technique, preprint available from the authors, \n                    \n                      http:\/\/www.isg.rhul.ac.uk\/~sean\/"},{"key":"7_CR47","unstructured":"NESSIE Security Report, V2.0, available at \n                    \n                      http:\/\/www.cryptonessie.org"},{"key":"7_CR48","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":"7_CR49","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.T.: \n                    \n                      \n                    \n                    $C^{*}_{-+}$\n                   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\u201350. Springer, Heidelberg (1998)"},{"key":"7_CR50","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 - CT-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.\u00a02020, pp. 282\u2013297. Springer, Heidelberg (2001) Update at \n                    \n                      http:\/\/www.cryptonessie.org"},{"key":"7_CR51","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 SFLASH\n                              v2 available at \n                    \n                      http:\/\/www.cryptonessie.org"},{"key":"#cr-split#-7_CR52.1","doi-asserted-by":"crossref","unstructured":"Stanley, R.: Enumerative Combinatorics, vol.\u00a01, second printing (1996)","DOI":"10.1017\/CBO9781139058520.002"},{"key":"#cr-split#-7_CR52.2","unstructured":"vol.\u00a02 in (1999) Both published by Cambridge University Press, Cambridge"},{"key":"7_CR53","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. Numer. Math.\u00a013, 354\u2013356 (1969)","journal-title":"Numer. Math."},{"key":"7_CR54","unstructured":"Sugita, M., Kawazoe, M., Imai, H.: Relation between XL algorithm and Groebner Bases Algorithms, preprint, \n                    \n                      http:\/\/eprint.iacr.org\/2004\/112\n                    \n                    \n                   Part of this merged with [2]"},{"key":"7_CR55","unstructured":"Szeg\u00f6, G.: Orthogonal Polynomials, 4th edn. American Math. Society, Providence"},{"issue":"1","key":"7_CR56","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":"7_CR57","volume-title":"Asymptotic Approximations of Integrals","author":"R. Wong","year":"1989","unstructured":"Wong, R.: Asymptotic Approximations of Integrals. Academic Press, San Diego (1989)"},{"key":"7_CR58","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)"},{"key":"7_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-30191-2_31","volume-title":"Information and Communications Security","author":"B.-Y. Yang","year":"2004","unstructured":"Yang, B.-Y., Chen, J.-M., Courtois, N.T.: On asymptotic security estimates in XL and gr\u00f6bner bases-related algebraic cryptanalysis. In: L\u00f3pez, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol.\u00a03269, pp. 401\u2013413. Springer, Heidelberg (2004) Formerly titled Exact and Asymptotic Behavior of XL-Related Methods"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496618_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:01:51Z","timestamp":1558281711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496618_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262268","9783540320838"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/11496618_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}