QUAD: A practical stream cipher with provable security

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4004 LNCS, Issue , 2006, Pages 109-128

  Berbain, Côme ^a   Gilbert, Henri ^a   Patarin, Jacques ^b  

^a France Telecom Research and Development ^*  (France)

^b LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIVARIABLE SYSTEMS; NONLINEAR PROGRAMMING; NUMERICAL METHODS; SECURITY OF DATA;

CIPHER; MULTIVARIATE QUADRATIC SYSTEM; QUAD; QUADRATIC EQUATIONS;

CRYPTOGRAPHY;

EID: 33746077698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11761679_8     Document Type: Conference Paper

References (31)

1. Magali Bardet. Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie. PhD thesis, Université Paris VI, 2004.
2. Mihir Bellare. The Goldreich-Levin Theorem. http://www-cse.ucsd.edu/ users/mihir/courses.html, 1999.
3. Lenore Blum, Manuel Slum, and Mike Shub. A simple unpredictable pseudo-random number generator. SIAM J. Comput., 15(2):364-383, 1986.
4. Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput., 13(4):850-864, 1984.
5. Don Coppersmith, Shai Halevi, and Charanjit S. Jutla. Cryptanalysis of stream ciphers with linear masking. In Moti Yung, editor, Advances in Cryptology CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 515-532. Springer-Verlag, 2002.
6. Nicolas Courtois, Louis Goubin, Willi Meier, and Jean-Daniel Tacier. Solving underdefined systems of multivariate quadratic equations. In Public Key Cryptography, pages 211-227, 2002.
7. Nicolas Courtois, Alexander Klimov, Jacques Patarin, and Adi Shamir. Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In Bart Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 392-407. Springer-Verlag, 2000.
8. Nicolas Courtois and Willi Meier. Algebraic attacks on stream ciphers with linear feedback. In Eli Biham, editor, Advances in Cryptology - EUROCRYPT 2003, volume 2656 of Lecture Notes in'Computer Science, pages 345-359. Springer-Verlag, 2003.
9. Nicolas Courtois and Jacques Patarin. About the XL Algorithm over GF(2). In Marc Joye, editor, Topics in Cryptology - CT-RSA 2003, volume 2612 of Lecture Notes in Computer Science, pages 141-157. Springer-Verlag, 2003.
10. Claus Diem. The XL-Algorithm and a Conjecture from Commutative Algebra. In Pil Joong Lee, editor, Advances in Cryptology - ASIACRYPT 2004, volume 3329 of Lecture Notes in Computer Science, pages 323-337. Springer-Verlag, 2004.
11. ECRYPT. eSTREAM: ECRYPT Stream Cipher Project, IST-2002-507932. Available at http://www.ecrypt.eu.org/stream/, Accessed September 29, 2005, 2005.
12. Jean-Charles Faugère, Hideki Imai, Mitsuru Kawazoe, Makoto Sugita, and Gwénolé Ars. Comparison Between XL and Grbner Basis Algorithms. In Pil Joong Lee, editor, Advances in Cryptology - ASIACRYPT 2004, volume 3329 of Lecture Notes in Computer Science, pages 338-353. Springer-Verlag, 2004.
13. Jean-Bernard Fischer and Jacques Stern. An efficient pseudo-random generator provably as secure as syndrome decoding. In EUROCRYPT, pages 245-255, 1996.
14. Aviezri S. Praenkel and Yaacov Yesha. Complexity of solving algebraic equations. Inf. Process. Lett., 10(4/5):178-179, 1980.
15. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, chapter 7.2 Algebraic Equations over GF(2). W H Freeman & Co, 1979.
16. Rosario Gennaro. An improved pseudo-random generator based on discrete log. In CRYPTO, pages 469-481, 2000.
17. Oded Goldreich. Three xor-lemmas an exposition. Technical report, Weizmann Instritute of Science, Revohot, Israel, 1995.
18. Oded Goldreich. Fondationsof Cryptography, volume 1. Cambridge University Press, 2001.
19. Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. J. ACM, 33(4):792-807, 1986.
20. Shafi Goldwasser and Mihir Bellare. Lecture notes on cryptography. Available at http://wwv-cse.ucsd.edu/users/mihir/courses.html, 2001.
21. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM J. Comput, 28(4):1364-1396, 1999.
22. Russel Impagliazzo, Leonid A. Levin, and Michael Luby. Pseudo-random generation from one-way functions. In D.S.Johnson, editor, 21th ACM Symposium on Theory of Computing - STOC '89, pages 12-24. ACM Press, 1989.
23. Russel Impagliazzo and Moni Naor. Efficient cryptographic schemes provably as secure as subset sum. Journal of Cryptology, 9(4):199-216, 1996.
24. Russell Impagliazzo and Moni Naor. Efficient cryptographic schemes provably as secure as subset sum. J. Cryptology, 9(4):199-216, 1996.
25. Leonid A. Levin and Oded Goldreich. A hard-core predicate for all one-way functions. In D. S. Johnson, editor, 21th ACM Symposium on Theory of Computing -STOC '89, pages 25-32. ACM Press, 1989.
26. Rudolf Lidl and Haradl Niederreiter. Finite Field's. Cambride University Press, 1997.
27. National Institute of Standards and Technology. FIPS-197: Advanced Encryption Standard, November 2001. Available at http://csrc.nist.gov/ publications/fips/.
28. Jacques Patarin and Louis Goubin. Asymmetric cryptography with s-boxes. In ICICS, pages 369-380, 1997.
29. Jacques Patarin and Louis Goubin. Asymmetric cryptography with s-boxes. In ICICS, pages 369-380, 1997.
30. Johan Håstad and Mats Näslund. Bmgl: Synchronous key-stream henerator with provable security, submitted to Nessie Project, 2000.
31. Andrew Yao. Theory and applications of trapdoor function. In Foundations of Cryptography FOCS 1982, 1982.