E. Biham, New types of cryptoanalytic attacks using related keys (extended abstract), Advances in Cryptology -EUROCRYPT '93, vol.765, pp.398-409, 1993.

E. Biham and A. Shamir, Differential cryptoanalysis of feal and n-hash, Advances in Cryptology -EUROCRYPT '91, vol.547, pp.1-16, 1991.

A. Biryukov and I. Nikolic, Automatic search for related-key differential characteristics in byte-oriented block ciphers: Application to aes, camellia, khazad and others, Advances in Cryptology -EUROCRYPT 2010, vol.6110, pp.322-344, 2010.

J. Daemen and V. Rijmen, The Design of Rijndael, 2002.

D. De, A. Kumarasubramanian, and R. Venkatesan, Inversion attacks on secure hash functions using satsolvers, Theory and Applications of Satisfiability Testing -SAT 2007, vol.4501, pp.377-382, 2007.

, Advanced Encryption Standard. Federal Information Processing Standards Publication 197, FIPS 197, 2001.

J. Pierre-alain-fouque, T. Jean, and . Peyrin, Structural evaluation of aes and chosen-key distinguisher of 9-round aes-128, Advances in Cryptology -CRYPTO 2013, vol.8042, pp.183-203

. Springer, , 2013.

F. Legendre, G. Dequen, and M. Krajecki, Encoding hash functions as a sat problem, IEEE 24th International Conference on Tools with Artificial Intelligence, vol.2012, pp.916-921, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00846945

I. Mironov and L. Zhang, Applications of sat solvers to cryptanalysis of hash functions, Theory and Applications of Satisfiability Testing -SAT, vol.4121, pp.102-115, 2006.

P. Morawiecki and M. Srebrny, A sat-based preimage analysis of reduced keccak hash functions, Inf. Process. Lett, vol.113, pp.392-397, 2013.

N. Mouha, Q. Wang, D. Gu, and B. Preneel, Differential and linear cryptanalysis using mixed-integer linear programming, Information Security and Cryptology -7th International Conference, vol.7537, pp.57-76, 2011.

C. Prudhomme and J. Fages, An introduction to choco 3.0: an open source java constraint programming library, CP Workshop on "CP Solvers: Modeling, Applications, Integration, and Standardization, 2013.

M. Soos, K. Nohl, and C. Castelluccia, Extending sat solvers to cryptographic problems, Theory and Applications of Satisfiability Testing -SAT 2009, vol.5584, pp.244-257, 2009.

X. Wang, Y. Lisa-yin, and H. Yu, Finding collisions in the full sha-1, Advances in Cryptology -CRYPTO 2005, vol.3621, pp.17-36, 2005.

X. Wang and H. Yu, How to break md5 and other hash functions, Advances in Cryptology -EUROCRYPT 2005, vol.3494, pp.19-35, 2005.

X. Wang, H. Yu, and Y. Lisa-yin, Efficient collision search attacks on sha-0, Advances in Cryptology -CRYPTO 2005, vol.3621, pp.1-16, 2005.