T. Becker, V. Weispfenning, and H. Kredel, Gröbner bases: a computational approach to commutative algebra, 1993.

G. Bertoni, J. Daemen, M. Peeters, and G. V. Assche, On the Indifferentiability of the Sponge Construction, Lecture Notes in Computer Science, vol.4965, pp.181-197, 2008.
DOI : 10.1007/978-3-540-78967-3_11

G. Bertoni, J. Daemen, M. Peeters, and G. V. Assche, RadioGatún, a Belt-and-Mill Hash Function. Presented at Second Cryptographic Hash Function Workshop, 2006.

G. Bertoni, J. Daemen, M. Peeters, and G. V. Assche, Sponge functions. Presented at ECrypt Hash Function Workshop, 2007.

S. Collart, M. Kalkbrener, and D. Mall, Converting Bases with the Gr??bner Walk, Journal of Symbolic Computation, vol.24, issue.3-4, pp.465-469, 1997.
DOI : 10.1006/jsco.1996.0145

H. Comon, Inductionless induction Handbook of Automated Reasoning, pp.913-962, 2001.

D. Cox, J. Little, and D. O-'shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 2007.

J. Daemen, Cipher and hash function design. Strategies based on linear and differential cryptanalysis, 1995.

J. Daemen and G. V. Assche, Producing Collisions for Panama, Instantaneously, Lecture Notes in Computer Science, vol.4593, pp.1-18, 2007.
DOI : 10.1007/978-3-540-74619-5_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.6495

J. Daemen and C. S. Clapp, Fast Hashing and Stream Encryption with Panama, Lecture Notes in Computer Science, vol.1372, pp.60-74, 1998.
DOI : 10.1007/3-540-69710-1_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.6033

J. C. Faugère, A new efficient algorithm for computing Gr??bner bases (F4), Journal of Pure and Applied Algebra, vol.139, issue.1-3, pp.1-3, 1999.
DOI : 10.1016/S0022-4049(99)00005-5

J. C. Faugère, P. M. Gianni, D. Lazard, and T. Mora, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-344, 1993.
DOI : 10.1006/jsco.1993.1051

J. Goubault-larrecq, M. Roger, and K. N. Verma, Abstraction and resolution modulo AC: How to verify Diffie???Hellman-like protocols automatically, The Journal of Logic and Algebraic Programming, vol.64, issue.2, pp.219-251, 2005.
DOI : 10.1016/j.jlap.2004.09.004
URL : http://doi.org/10.1016/j.jlap.2004.09.004

R. Lidl and H. Niederreiter, Finite Fields (Encyclopedia of Mathematics and its Applications), 1996.

T. Peyrin, Cryptanalysis of Grindahl, In: ASIACRYPT, pp.551-567, 2007.
DOI : 10.1007/978-3-540-76900-2_34

V. Rijmen, B. V. Rompay, B. Preneel, and J. Vandewalle, Producing Collisions for PANAMA, Lecture Notes in Computer Science, vol.2355, pp.37-51, 2001.
DOI : 10.1007/3-540-45473-X_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.527.6364