{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T02:33:09Z","timestamp":1783823589741,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540746171","type":"print"},{"value":"9783540746195","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74619-5_19","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T10:19:51Z","timestamp":1187345991000},"page":"290-308","source":"Crossref","is-referenced-by-count":31,"title":["Analysis of QUAD"],"prefix":"10.1007","author":[{"given":"Bo-Yin","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Owen Chia-Hsin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel J.","family":"Bernstein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiun-Ming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Ars, G., Faug\u00e8re, J.-C., Imai, H., Kawazoe, M., Sugita, M.: Comparison between XL and Gr\u00f6bner Basis algorithms. In: AsiaCrypt [25], pp. 338\u2013353.","DOI":"10.1007\/978-3-540-30539-2_24"},{"key":"19_CR2","unstructured":"Bardet, M.: \u00c9tude des syst\u00e8mes alg\u00e9briques surd\u00e9terminin\u00e9s. Applications aux codes correcteurs et \u00e1 la cryptographie. PhD thesis, Universit\u00e9 Paris VI (2004)"},{"key":"19_CR3","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B.: On the complexity of gr\u00f6bner basis computation of semi-regular overdetermined algebraic equations. In: Proceedings of the International Conference on Polynomial System Solving, pp. 71\u201374 (2004)"},{"key":"19_CR4","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic expansion of the degree of regularity for semi-regular systems of equations. In: Gianni, P. (ed.) MEGA 2005, Sardinia, Italy (2005)"},{"key":"19_CR5","unstructured":"Berbain, C., Billet, O., Gilbert, H.: Efficient implementations of multivariate quadratic systems. In: Workshop record distributed at 13th Annual Workshop on Selected Areas in Cryptography (August 2006)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Berbain, C., Gilbert, H.: On the security of IV dependent stream ciphers. In: Workshop record distributed at 14th Annual Workshop on Fast Software Encryption (March 2007)","DOI":"10.1007\/978-3-540-74619-5_17"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11761679_8","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Berbain","year":"2006","unstructured":"Berbain, C., Gilbert, H., Patarin, J.: QUAD: A practical stream cipher with provable security. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 109\u2013128. Springer, Heidelberg (2006)"},{"key":"19_CR8","first-page":"61","volume-title":"Comparison of two pseudo-random number generators","author":"L. Blum","year":"1983","unstructured":"Blum, L., Blum, M., Shub, M.: Comparison of two pseudo-random number generators, pp. 61\u201378. Plenum Press, New York (1983)"},{"key":"19_CR9","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Innsbruck (1965)"},{"key":"19_CR10","unstructured":"Computational Algebra Group, University of Sydney. The MAGMA Computational Algebra System for Algebra, Number Theory and Geometry, http:\/\/magma.maths.usyd.edu.au\/magma\/"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-540-24632-9_15","volume-title":"Public Key Cryptography \u2014 PKC\u00a02004","author":"N. Courtois","year":"2004","unstructured":"Courtois, N.: Algebraic attacks over $GF(2^{\\mbox{k}}$ ), application to HFE challenge 2 and Sflash-v2. In: Bao, F., Deng, R.H., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 201\u2013217. Springer, Heidelberg (2004)"},{"key":"19_CR12","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.T. Courtois","year":"2000","unstructured":"Courtois, N.T., 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), http:\/\/www.minrank.org\/xlfull.pdf"},{"key":"19_CR13","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":"19_CR14","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":"19_CR15","doi-asserted-by":"crossref","unstructured":"Diem, C.: The xl-algorithm and a conjecture from commutative algebra. In: AsiaCrypt [25], pp. 323\u2013337","DOI":"10.1007\/978-3-540-30539-2_23"},{"key":"19_CR16","unstructured":"Ding, J., Gower, J., Schmidt, D.: Multivariate Public-Key Cryptosystems. Advances in Information Security. Springer, Heidelberg (2006)"},{"key":"19_CR17","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, 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"International Symposium on Symbolic and Algebraic Computation \u2014 ISSAC\u00a02002","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 (F 5). In: International Symposium on Symbolic and Algebraic Computation \u2014 ISSAC\u00a02002, pp. 75\u201383. ACM Press, New York (2002)"},{"key":"19_CR19","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) using Gr\u00f6bner bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 44\u201360. Springer, Heidelberg (2003)"},{"key":"19_CR20","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness. In: W.H. Freeman and Company (1979), ISBN 0-7167-1044-7 or 0-7167-1045-5."},{"key":"19_CR21","unstructured":"Koblitz, N., Menezes, A.: Another look at \u201cprovable security\u201d. Cryptology ePrint Archive, Report 2004\/152 (2004), http:\/\/eprint.iacr.org\/"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/11941378_12","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"N. Koblitz","year":"2006","unstructured":"Koblitz, N., Menezes, A.: Another look at \u201dprovable security\u201d. ii. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 148\u2013175. Springer, Heidelberg (2006)"},{"key":"19_CR23","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":"19_CR24","series-title":"Cambridge Mathematical Library","doi-asserted-by":"crossref","DOI":"10.3792\/chmm\/1263317740","volume-title":"The algebraic theory of modular systems","author":"F.S. Macaulay","year":"1916","unstructured":"Macaulay, F.S.: The algebraic theory of modular systems. Cambridge Mathematical Library, vol.\u00a0xxxi. Cambridge University Press, Cambridge (1916)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Advances in Cryptology - ASIACRYPT 2004","year":"2004","unstructured":"Lee, P.J. (ed.): ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 3\u2013540. Springer, Heidelberg (2004)"},{"key":"19_CR26","unstructured":"Raddum, H., Semaev, I.: New technique for solving sparse equation systems. Cryptology ePrint Archive, Report 2006\/475 (2006), http:\/\/eprint.iacr.org\/"},{"key":"19_CR27","unstructured":"Wolf, C., Preneel, B.: Taxonomy of public key schemes based on the problem of multivariate quadratic equations. Cryptology ePrint Archive, Report 2005\/077, 64 pages (May 12 th 2005), http:\/\/eprint.iacr.org\/2005\/077\/"},{"key":"19_CR28","unstructured":"Wong, R.: Asymptotic approximations of integrals, vol. 34 of Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, Corrected reprint of the 1989 original (2001)"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","first-page":"67","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B.-Y. Yang","year":"2005","unstructured":"Yang, B.-Y., Chen, J.-M.: All in the XL family: Theory and practice. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 67\u201386. Springer, Heidelberg (2005)"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74619-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T23:31:22Z","timestamp":1629588682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74619-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540746171","9783540746195"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74619-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}