{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,19]],"date-time":"2026-11-19T22:53:00Z","timestamp":1795128780911,"version":"4.10.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540345466","type":"print"},{"value":"9783540345473","type":"electronic"}],"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_8","type":"book-chapter","created":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T10:11:19Z","timestamp":1152007879000},"page":"109-128","source":"Crossref","is-referenced-by-count":65,"title":["QUAD: A Practical Stream Cipher with Provable Security"],"prefix":"10.1007","author":[{"given":"C\u00f4me","family":"Berbain","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henri","family":"Gilbert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacques","family":"Patarin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Bardet, M.: \u00c9tude des syst\u00e8mes alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e0 la cryptographie. PhD thesis, Universit\u00e9 Paris VI (2004)"},{"key":"8_CR2","unstructured":"Bellare, M.: The Goldreich-Levin Theorem (1999), \n                    \n                      http:\/\/www-cse.ucsd.edu\/users\/mihir\/courses.html"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput.\u00a015(2), 364\u2013383 (1986)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput.\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-45708-9_33","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"D. Coppersmith","year":"2002","unstructured":"Coppersmith, D., Halevi, S., Jutla, C.S.: Cryptanalysis of stream ciphers with linear masking. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 515\u2013532. Springer, Heidelberg (2002)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45664-3_15","volume-title":"Public Key Cryptography","author":"N. Courtois","year":"2002","unstructured":"Courtois, N., Goubin, L., Meier, W., Tacier, J.-D.: Solving underdefined systems of multivariate quadratic equations. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 211\u2013227. Springer, Heidelberg (2002)"},{"key":"8_CR7","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":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-39200-9_21","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"N. Courtois","year":"2003","unstructured":"Courtois, N., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 345\u2013359. Springer, Heidelberg (2003)"},{"key":"8_CR9","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":"8_CR10","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)"},{"key":"8_CR11","unstructured":"ECRYPT. eSTREAM: ECRYPT Stream Cipher Project, IST-2002-507932 (accessed September 29, 2005), available at: \n                    \n                      http:\/\/www.ecrypt.eu.org\/stream\/"},{"key":"8_CR12","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":"J.-C. Faug\u00e8re","year":"2004","unstructured":"Faug\u00e8re, J.-C., Imai, H., Kawazoe, M., Sugita, M., Ars, G.: 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":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-49097-3","volume-title":"Advances in Cryptology 1981 - 1997","author":"J.-B. Fischer","year":"1999","unstructured":"Fischer, J.-B., Stern, J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol.\u00a01440, pp. 245\u2013255. Springer, Heidelberg (1999)"},{"issue":"4\/5","key":"8_CR14","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/0020-0190(80)90134-9","volume":"10","author":"A.S. Fraenkel","year":"1980","unstructured":"Fraenkel, A.S., Yesha, Y.: Complexity of solving algebraic equations. Inf. Process. Lett.\u00a010(4\/5), 178\u2013179 (1980)","journal-title":"Inf. Process. Lett."},{"key":"8_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness, ch. 7.2 Algebraic Equations over GF(2)","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, ch.7.2 Algebraic Equations over GF(2). W H Freeman & Co, New York (1979)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/3-540-44598-6_29","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"R. Gennaro","year":"2000","unstructured":"Gennaro, R.: An improved pseudo-random generator based on discrete log. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 469\u2013481. Springer, Heidelberg (2000)"},{"key":"8_CR17","unstructured":"Goldreich, O.: Three xor-lemmas an exposition. Technical report, Weizmann Instritute of Science, Revohot, Israel (1995)"},{"key":"8_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Fondationsof Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Fondations of Cryptography, vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"issue":"4","key":"8_CR19","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"8_CR20","unstructured":"Goldwasser, S., Bellare, M.: Lecture notes on cryptography (2001), available at: \n                    \n                      http:\/\/www-cse.ucsd.edu\/users\/mihir\/courses.html"},{"issue":"4","key":"8_CR21","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"8_CR22","first-page":"12","volume-title":"21th ACM Symposium on Theory of Computing \u2013 STOC 1989","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Johnson, D.S. (ed.) 21th ACM Symposium on Theory of Computing \u2013 STOC 1989, pp. 12\u201324. ACM Press, New York (1989)"},{"issue":"4","key":"8_CR23","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. Journal of Cryptology\u00a09(4), 199\u2013216 (1996)","journal-title":"Journal of Cryptology"},{"issue":"4","key":"8_CR24","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. J. Cryptology\u00a09(4), 199\u2013216 (1996)","journal-title":"J. Cryptology"},{"key":"8_CR25","first-page":"25","volume-title":"21th ACM Symposium on Theory of Computing \u2013 STOC 1989","author":"L.A. Levin","year":"1989","unstructured":"Levin, L.A., Goldreich, O.: A hard-core predicate for all one-way functions. In: Johnson, D.S. (ed.) 21th ACM Symposium on Theory of Computing \u2013 STOC 1989, pp. 25\u201332. ACM Press, New York (1989)"},{"key":"8_CR26","volume-title":"Finite Fields","author":"R. Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)"},{"key":"8_CR27","unstructured":"National Institute of Standards and Technology. FIPS-197: Advanced Encryption Standard (November 2001), available at: \n                    \n                      http:\/\/csrc.nist.gov\/publications\/fips\/"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BFb0028492","volume-title":"Information and Communications Security","author":"J. Patarin","year":"1997","unstructured":"Patarin, J., Goubin, L.: Asymmetric cryptography with s-boxes. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 369\u2013380. Springer, Heidelberg (1997)"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BFb0028492","volume-title":"Information and Communications Security","author":"J. Patarin","year":"1997","unstructured":"Patarin, J., Goubin, L.: Asymmetric cryptography with s-boxes. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 369\u2013380. Springer, Heidelberg (1997)"},{"key":"8_CR30","unstructured":"H\u00e5stad, J., N\u00e4slund, M.: Bmgl: Synchronous key-stream henerator with provable security (submitted to Nessie Project 2000)"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Yao, A.: Theory and applications of trapdoor function. In: Foundations of Cryptography FOCS 1982 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:16:56Z","timestamp":1552346216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11761679_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345466","9783540345473"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11761679_8","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11761679","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}