QUAD: Overview and Recent Developments

Dagstuhl Seminar Proceedings

Volumn 7021, Issue , 2007, Pages

  Arditti, David ^a   Berbain, Côme ^a   Billet, Olivier ^a   Gilbert, Henri ^a   Patarin, Jacques ^b  

^a ORANGE LABS   (France)

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

Author keywords

Gr bner basis computation; MQ problem; provable security; stream cipher

Indexed keywords

COMPUTER HARDWARE; HARDWARE SECURITY; SECURITY SYSTEMS;

CONCRETE SECURITIES; FINITE FIELDS; GRÖBNE BASE COMPUTATION; KEYSTREAM; MQ PROBLEM; MULTIVARIATE SYSTEMS; PROVABLE SECURITY; QUADRATIC EQUATIONS; SECURITY FEATURES; STREAM CIPHERS;

CRYPTOGRAPHY;

EID: 84895203722     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Rosss Anderson, Eli Biham, and Lars Ramkilde Knudsen. Serpent: A flexible block cipher with maximum assurance. In Proceedings of the First Advanced Encryption Standard Conference, 1998.
2. Magali Bardet. Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie. PhD thesis, Université Paris VI, 2004.
3. Mihir Bellare. The Goldreich-Levin Theorem. http://www-cse.ucsd.edu/users/mihir/courses.html, 1999.
4. Côme Berbain, Olivier Billet, and Henri Gilbert. Efficient implementations of multivariate quadratic systems. In Selected Areas in Cryptography – SAC 2006, To appear in Lecture Notes in Computer Science. Springer-Verlag, 2006.
5. Côme Berbain, Henri Gilbert, and Jacques Patarin. QUAD: a Practical Stream Cipher with Provable Security. In Serge Vaudenay, editor, Advances in Cryptology – EUROCRYPT 2006, Lecture Notes in Computer Science. Springer-Verlag, 2006.
6. Lenore Blum, Manuel Blum, and Mike Shub. A simple unpredictable pseudorandom number generator. SIAM J. Comput., 15(2):364–383, 1986.
7. Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput., 13(4):850–864, 1984.
8. Dan Boneh, Shai Halevi, and Nick Howgrave-Graham. The modular inversion hidden number problem. In ASIACRYPT, pages 36–51, 2001.
9. Christophe De Cannière and Bart Preneel. Trivium: Specifications. eSTREAM, ECRYPT Stream Cipher Project, Report 2005/001, 2005. Available at http://www.ecrypt.eu.org/stream.
10. 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.
11. 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.
12. 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.
13. ECRYPT. eSTREAM: ECRYPT Stream Cipher Project, IST-2002-507932. Available at http://www.ecrypt.eu.org/stream/, Accessed September 29, 2005, 2005.
14. Patrik Ekdahl and Thomas Johansson. A new version of the stream cipher SNOW. In Kaisa Nyberg and Howard M. Heys, editors, Proceedings of Selected Areas in Cryptography – SAC’02, number 2595, 2002.
15. 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.
16. Jean-Bernard Fischer and Jacques Stern. An efficient pseudo-random generator provably as secure as syndrome decoding. In EUROCRYPT, pages 245–255, 1996.
17. Aviezri S. Fraenkel and Yaacov Yesha. Complexity of solving algebraic equations. Inf. Process. Lett., 10(4/5):178–179, 1980.
18. 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.
19. Oded Goldreich. The Foundations of Cryptography - Volume 1. Cambridge University Press, 2001.
20. Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to Construct Random Functions. J. ACM, 33(4):792–807, 1986.
21. Oded Goldreich and Leonid A. Levin. 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.
22. Shafi Goldwasser and Mihir Bellare. Lecture notes on cryptography. Available at http://www-cse.ucsd.edu/users/mihir/courses.html, 2001.
23. Shai Halevi, Don Coppersmith, and Charanjit S. Jutla. Scream: A software-efficient stream cipher. In Joan Daemen and Vincent Rijmen, editors, Proceedings of Fast Software Encryption – FSE’02, number 2365, pages 195–209, 2002.
24. 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.
25. Johan Håstad and Mats Näslund. BMGL: Synchronous key-stream henerator with provable security. submitted to Nessie Project, 2000.
26. M. Hell, T. Johansson, and W. Meier. Grain - A Stream Cipher for Constrained Environments. ECRYPT Stream Cipher Project Report 2005/001, 2005. http://www.ecrypt.eu.org/stream.
27. Russell Impagliazzo and Moni Naor. Efficient cryptographic schemes provably as secure as subset sum. J. Cryptology, 9(4):199–216, 1996.
28. Rudolf Lidl and Haradl Niederreiter. Finite Fields. Cambride University Press, 1997.
29. Jacques Patarin and Louis Goubin. Asymmetric cryptography with s-boxes. In ICICS, pages 369–380, 1997.
30. Ronald Rivest. The RC4 enycryption algorithm. RSA Security Inc., March 1992.
31. Adi Shamir. On the Generation of Cryptographically Strong Pseudo-Random Sequences. In ICALP, pages 544–550, 1981.
32. Ron Steinfeld, Josef Pieprzyk, and Huaxiong Wang. On the provable security of an efficient rsa-based pseudorandom generator. In ASIACRYPT, pages 194–209, 2006.
33. Andrew Yao. Theory and Applications of Trapdoor Function. In Foundations of Cryptography FOCS 1982, 1982.