M. A. Abdelraheem, C. Blondeau, M. Naya-plasencia, M. Videau, and E. Zenner, Cryptanalysis of AR- MADILLO2, pp.308-326

K. Aoki, K. Kobayashi, and S. Moriai, Best differential characteristic search of FEAL, Lecture Notes in Computer Science, vol.1267, pp.41-53, 1997.
DOI : 10.1007/BFb0052333

P. S. Barreto and V. Rijmen, The Whirlpool Hashing Function, Available, vol.24, 2000.

E. Biham, New Types of Cryptanalytic Attacks Using Related Keys, Lecture Notes in Computer Science, vol.765, pp.398-409, 1993.
DOI : 10.1007/3-540-48285-7_34

E. Biham and O. Dunkelman, The SHAvite-3 Hash Function, 2009.

E. Biham, O. Dunkelman, and N. Keller, A Unified Approach to Related-Key Attacks, pp.73-96
DOI : 10.1007/978-3-540-71039-4_5

E. Biham and A. Shamir, Differential Cryptanalysis of DES-like Cryptosystems, CRYPTO'91, 1991.

A. Biryukov and D. Khovratovich, Related-Key Cryptanalysis of the Full AES-192 and AES-256, pp.1-18
DOI : 10.1007/978-3-642-10366-7_1

A. Biryukov, D. Khovratovich, and I. Nikolic, Distinguisher and Related-Key Attack on the Full AES-256, Lecture Notes in Computer Science, vol.5677, pp.231-249, 2009.
DOI : 10.1007/978-3-642-03356-8_14

A. Biryukov and I. Nikolic, Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others, Lecture Notes in Computer Science, vol.6110, pp.322-344, 2010.
DOI : 10.1007/978-3-642-13190-5_17

A. Biryukov and I. Nikolic, Search for Related-Key Differential Characteristics in DES-Like Ciphers, Lecture Notes in Computer Science, vol.4, issue.1, pp.18-34, 2011.
DOI : 10.1007/BFb0053451

A. Biryukov and A. Shamir, Structural Cryptanalysis of SASAS, Journal of Cryptology, vol.23, issue.4, pp.505-518, 2010.
DOI : 10.1007/s00145-010-9062-1

A. Bogdanov, L. R. Knudsen, G. Leander, C. Paar, A. Poschmann et al., PRESENT: An Ultra-Lightweight Block Cipher, Lecture Notes in Computer Science, vol.4727, pp.450-466, 2007.
DOI : 10.1007/978-3-540-74735-2_31

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.2536

C. Bouillaguet, P. Derbez, and P. A. Fouque, Automatic Search of Attacks on Round-Reduced AES and Applications, Lecture Notes in Computer Science, vol.6841, pp.169-187, 2011.
DOI : 10.1007/978-3-642-22792-9_10

URL : https://hal.archives-ouvertes.fr/hal-01110414

C. D. Cannière and C. Rechberger, Finding SHA-1 Characteristics: General Results and Applications, Lecture Notes in Computer Science, vol.4284, pp.1-20, 2006.
DOI : 10.1007/11935230_1

J. Daemen and V. Rijmen, The Design of Rijndael: AES -The Advanced Encryption Standard, 2002.
DOI : 10.1007/978-3-662-04722-4

P. Derbez, P. A. Fouque, and J. Jean, Faster Chosen-Key Distinguishers on Reduced-Round AES, Lecture Notes in Computer Science, vol.7668, pp.225-243, 2012.
DOI : 10.1007/978-3-642-34931-7_14

URL : https://hal.archives-ouvertes.fr/hal-01094335

P. Gauravaram, L. R. Knudsen, K. Matusiewicz, F. Mendel, C. Rechberger et al., Grøstl ? a SHA-3 candidate, 2011.

H. Gilbert and T. Peyrin, Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations, Lecture Notes in Computer Science, vol.6147, pp.365-383, 2010.
DOI : 10.1007/978-3-642-13858-4_21

P. Hart, N. Nilsson, and B. Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968.
DOI : 10.1109/TSSC.1968.300136

J. Jean, M. Naya-plasencia, and T. Peyrin, Improved Rebound Attack on the Finalist Gr??stl, Lecture Notes in Computer Science, vol.7549, pp.110-126, 2012.
DOI : 10.1007/978-3-642-34047-5_7

D. Khovratovich, A. Biryukov, and I. Nikolic, Speeding up Collision Search for Byte-Oriented Hash Functions, Lecture Notes in Computer Science, vol.5473, pp.164-181, 2009.
DOI : 10.1007/11426639_2

L. R. Knudsen, Truncated and higher order differentials, LNCS, vol.1008, pp.196-211, 1995.
DOI : 10.1007/3-540-60590-8_16

L. R. Knudsen and V. Rijmen, Known-Key Distinguishers for Some Block Ciphers, Lecture Notes in Computer Science, vol.4833, pp.315-324, 2007.
DOI : 10.1007/978-3-540-76900-2_19

M. Lamberger, F. Mendel, C. Rechberger, V. Rijmen, and M. Schläffer, Rebound Distinguishers: Results on the Full Whirlpool Compression Function, pp.126-143
DOI : 10.1007/978-3-642-10366-7_8

G. Leurent, ARXtools: A toolkit for ARX analysis, Second SHA-3 Conference, 2012.

S. Manuel and T. Peyrin, Collisions on SHA-0 in One Hour, pp.16-35
DOI : 10.1007/978-3-540-71039-4_2

M. Matsui, On correlation between the order of S-boxes and the strength of DES, Lecture Notes in Computer Science, vol.950, pp.366-375, 1994.
DOI : 10.1007/BFb0053451

M. Matsui, Advances in Cryptology -ASIACRYPT, 15th International Conference on the Theory and Application of Cryptology and Information Security Proceedings, 2009.

S. Matyas, C. Meyer, and J. Oseas, Generating Strong One-Way Functions With Cryptographic Algorithm - IBM Technical Disclosure Bulletin, 1985.

E. Miles and E. Viola, Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs, Lecture Notes in Computer Science, vol.7417, pp.68-85, 2012.
DOI : 10.1007/978-3-642-32009-5_5

K. Nyberg, Fast Software Encryption, 15th International Workshop Revised Selected Papers, Lecture Notes in Computer Science, vol.5086, 2008.

K. Ohta, S. Moriai, and K. Aoki, Improving the Search Algorithm for the Best Linear Expression, Lecture Notes in Computer Science, vol.963, pp.157-170, 1995.
DOI : 10.1007/3-540-44750-4_13

B. Preneel, R. Govaerts, and J. Vandewalle, Hash functions based on block ciphers: a synthetic approach, Lecture Notes in Computer Science, vol.773, pp.368-378, 1993.
DOI : 10.1007/3-540-48329-2_31

K. Shibutani, T. Isobe, H. Hiwatari, A. Mitsuda, T. Akishita et al., Piccolo: An Ultra-Lightweight Blockcipher, pp.342-357
DOI : 10.1007/978-3-642-23951-9_23

X. Wang, Y. L. Yin, and H. Yu, Finding Collisions in the Full SHA-1, Lecture Notes in Computer Science, vol.3621, pp.17-36, 2005.
DOI : 10.1007/11535218_2

X. Wang and H. Yu, How to Break MD5 and Other Hash Functions, Lecture Notes in Computer Science, vol.3494, pp.19-35, 2005.
DOI : 10.1007/11426639_2

A. Ks and S. Figure, Best truncated differential characteristics for AES-128 when r = 5 rounds with 11 active Sboxes, Figure, vol.9, issue.10