J. P. Aumasson, S. Fischer, S. Khazaei, W. Meier, and C. Rechberger, New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba, Lecture Notes in Computer Science, vol.5086, pp.470-488, 2008.
DOI : 10.1007/978-3-540-71039-4_30

E. Biham, On Matsui's linear cryptanalysis, Lecture Notes in Computer Science, vol.950, pp.341-355, 1994.
DOI : 10.1007/BFb0053449

E. Biham and Y. Carmeli, An Improvement of Linear Cryptanalysis with Addition Operations with Applications to FEAL-8X, Joux and Youssef [21], pp.59-76
DOI : 10.1007/978-3-319-13051-4_4

E. Biham, R. Chen, and A. Joux, Cryptanalysis of SHA-0 and Reduced SHA-1, Journal of Cryptology, vol.28, issue.1, pp.110-160, 2015.
DOI : 10.1007/s00145-014-9179-8

E. Biham, O. Dunkelman, and N. Keller, Enhancing Differential-Linear Cryptanalysis, Lecture Notes in Computer Science, vol.2501, pp.254-266, 2002.
DOI : 10.1007/3-540-36178-2_16

E. Biham and A. Shamir, Differential Cryptanalysis of DES-like Cryptosystems, Menezes and Vanstone [32], pp.2-21

E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, vol.36, issue.4, pp.3-72, 1991.
DOI : 10.1007/BF00630563

E. Biham and A. Shamir, Differential Cryptanalysis of Feal and N-Hash, Lecture Notes in Computer Science, vol.547, pp.1-16, 1991.
DOI : 10.1007/3-540-46416-6_1

A. Biryukov, C. D. Cannì-ere, and M. Quisquater, On Multiple Linear Approximations, Lecture Notes in Computer Science, vol.3152, pp.1-22, 2004.
DOI : 10.1007/978-3-540-28628-8_1

A. Biryukov, I. Nikolic, and A. Roy, Boomerang Attacks on BLAKE-32, Lecture Notes in Computer Science, vol.6733, pp.218-237, 2011.
DOI : 10.1007/3-540-48519-8_12

C. Blondeau, B. Gérard, and J. P. Tillich, Accurate estimates of the data complexity and success probability for various cryptanalyses, Designs, Codes and Cryptography, vol.51, issue.1-3, pp.1-3, 2011.
DOI : 10.1007/s10623-010-9452-2
URL : https://hal.archives-ouvertes.fr/hal-00610101

C. Blondeau, G. Leander, and K. Nyberg, Differential-linear cryptanalysis revisited, p.2014, 2014.

J. Y. Cho and J. Pieprzyk, Crossword Puzzle Attack on NLS, Lecture Notes in Computer Science, vol.4356, pp.249-265, 2006.
DOI : 10.1007/978-3-540-74462-7_18

B. Collard, F. X. Standaert, and J. J. Quisquater, Improving the Time Complexity of Matsui???s Linear Cryptanalysis, Lecture Notes in Computer Science, vol.4817, pp.77-88, 2007.
DOI : 10.1007/978-3-540-76788-6_7

Y. Desmedt, Advances in Cryptology -CRYPTO '94, 14th Annual International Cryptology Conference Proceedings, Lecture Notes in Computer Science, 1994.
DOI : 10.1007/3-540-48658-5

H. Gilbert and G. Chassé, A Statistical Attack of the FEAL-8 Cryptosystem, Menezes and Vanstone [32], pp.22-33
DOI : 10.1007/3-540-38424-3_2

M. Hermelin and K. Nyberg, Dependent Linear Approximations: The Algorithm of Biryukov and Others Revisited, Lecture Notes in Computer Science, vol.5985, pp.318-333, 2010.
DOI : 10.1007/978-3-642-11925-5_22

T. Huang, I. Tjuawinata, and H. Wu, Differential-Linear Cryptanalysis of ICEPOLE, p.2015, 2015.
DOI : 10.1007/978-3-662-48116-5_12

M. Lamberger and F. Mendel, Higher-Order Differential Attack on Reduced SHA-256, IACR Cryptology ePrint Archive Report, p.37, 2011.

S. K. Langford and M. E. Hellman, Differential-Linear Cryptanalysis, pp.17-25
DOI : 10.1007/3-540-48658-5_3

G. Leurent, Analysis of Differential Attacks in ARX Constructions, Lecture Notes in Computer Science, vol.7658, pp.226-243, 2012.
DOI : 10.1007/978-3-642-34961-4_15

G. Leurent, Construction of Differential Characteristics in ARX Designs Application to Skein, Lecture Notes in Computer Science, vol.1, issue.8042, pp.241-258, 2013.
DOI : 10.1007/978-3-642-40041-4_14

G. Leurent and A. Roy, Boomerang Attacks on Hash Function Using Auxiliary Differentials, Lecture Notes in Computer Science, vol.57, issue.4, pp.215-230, 2012.
DOI : 10.1007/3-540-45708-9_19

H. Lipmaa and S. Moriai, Efficient Algorithms for Computing Differential Properties of Addition, Lecture Notes in Computer Science, vol.2355, pp.336-350, 2001.
DOI : 10.1007/3-540-45473-X_28

M. Matsui, Linear Cryptanalysis Method for DES Cipher, Lecture Notes in Computer Science, vol.765, pp.386-397, 1993.
DOI : 10.1007/3-540-48285-7_33

M. Matsui and A. Yamagishi, A New Method for Known Plaintext Attack of FEAL Cipher, Lecture Notes in Computer Science, vol.658, pp.81-91, 1992.
DOI : 10.1007/3-540-47555-9_7

C. Mavromati, Key-Recovery Attacks Against the MAC Algorithm Chaskey, p.2015, 2015.
DOI : 10.1007/978-3-319-13051-4_19

F. Mendel and T. Nad, Boomerang Distinguisher for the SIMD-512 Compression Function, Lecture Notes in Computer Science, vol.57, issue.4, pp.255-269, 2011.
DOI : 10.1007/978-3-642-22497-3_11

A. Menezes and S. A. Vanstone, Advances in Cryptology -CRYPTO '90, 10th Annual International Cryptology Conference Proceedings, Lecture Notes in Computer Science, 1990.

H. Miyano, Addend dependency of differential/linear probability of addition, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, vol.81, issue.1, pp.106-109, 1998.

N. Mouha, B. Mennink, A. V. Herrewege, D. Watanabe, B. Preneel et al., Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers, Joux and Youssef [21], pp.306-323
DOI : 10.1007/978-3-319-13051-4_19

N. Mouha, V. Velichkov, C. D. Cannì-ere, and B. Preneel, The Differential Analysis of S-Functions, Lecture Notes in Computer Science, vol.34, issue.4, pp.36-56, 2010.
DOI : 10.1007/978-3-642-10838-9_16

S. Murphy, Overestimates for the Gain of Multiple Linear Approximations in Symmetric Cryptology, IEEE Transactions on Information Theory, vol.57, issue.7, pp.4794-4797, 2011.
DOI : 10.1109/TIT.2011.2145790

K. Nyberg and J. Wallén, Improved Linear Distinguishers for SNOW 2.0, Lecture Notes in Computer Science, vol.4047, pp.144-162, 2006.
DOI : 10.1007/11799313_10

K. Ohta and K. Aoki, Linear Cryptanalysis of the Fast Data Encipherment Algorithm, pp.12-16
DOI : 10.1007/3-540-48658-5_2

Y. Sasaki, Boomerang Distinguishers on MD4-Family: First Practical Results on Full 5-Pass HAVAL, Lecture Notes in Computer Science, vol.48, issue.5, pp.1-18, 2011.
DOI : 10.1007/11799313_7

A. Shimizu and S. Miyaguchi, Fast Data Encipherment Algorithm FEAL, Lecture Notes in Computer Science, vol.304, pp.267-278, 1987.
DOI : 10.1007/3-540-39118-5_24

A. Tardy-corfdir and H. Gilbert, A Known Plaintext Attack of FEAL-4 and FEAL-6, Lecture Notes in Computer Science, vol.576, pp.172-181, 1991.
DOI : 10.1007/3-540-46766-1_12

D. Wagner, The Boomerang Attack, Lecture Notes in Computer Science, vol.1636, pp.156-170, 1999.
DOI : 10.1007/3-540-48519-8_12

J. Wallén, Linear Approximations of Addition Modulo 2 n, Lecture Notes in Computer Science, vol.2887, pp.261-273, 2003.
DOI : 10.1007/978-3-540-39887-5_20

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

H. Yu, J. Chen, and X. Wang, The Boomerang Attacks on the Round-Reduced Skein-512, Lecture Notes in Computer Science, vol.7707, pp.287-303, 2012.
DOI : 10.1007/978-3-642-35999-6_19
URL : https://hal.archives-ouvertes.fr/hal-00922231