P. Barreto and V. Rijmen, The KHAZAD legacy-level block cipher, 2000.

E. Biham, Fast Software Encryption, 4th International Workshop, FSE '97 Proceedings, 1997.
DOI : 10.1007/BFb0052329

E. Biham and A. Shamir, Differential Cryptanalysis of DES-like Cryptosystems, Lecture Notes in Computer Science, vol.537, pp.2-21, 1990.
DOI : 10.1007/3-540-38424-3_1

B. Bilgin, A. Bogdanov, M. Knezevic, F. Mendel, and Q. Wang, Fides: Lightweight Authenticated Cipher with Side-Channel Resistance for Constrained Hardware, pp.142-158
DOI : 10.1007/978-3-642-40349-1_9

A. Biryukov and D. Wagner, Slide Attacks, pp.245-259
DOI : 10.1007/3-540-48519-8_18

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. Boura, A. Canteaut, and C. D. Cannì-ere, Higher-Order Differential Properties of Keccak and Luffa, Lecture Notes in Computer Science, vol.6733, pp.252-269, 2011.
DOI : 10.1007/978-3-642-13858-4_15
URL : https://hal.archives-ouvertes.fr/inria-00537741

J. Boyar and R. Peralta, A New Combinational Logic Minimization Technique with Applications to Cryptology, Lecture Notes in Computer Science, vol.6049, pp.178-189, 2010.
DOI : 10.1007/978-3-642-13193-6_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.405.9210

C. Cid, S. Murphy, and M. J. Robshaw, Small Scale Variants of the AES, Lecture Notes in Computer Science, vol.3557, pp.145-162, 2005.
DOI : 10.1007/11502760_10

J. S. Coron, Higher Order Masking of Look-Up Tables, Cryptology ePrint Archive, vol.700, 2013.
DOI : 10.1007/978-3-642-55220-5_25

J. Daemen, Limitations of the Even-Mansour construction, pp.495-498
DOI : 10.1007/3-540-57332-1_46

J. Daemen, L. R. Knudsen, and V. Rijmen, The block cipher Square, pp.149-165
DOI : 10.1007/BFb0052343

J. Daemen, M. Peeters, and G. V. Assche, Bitslice Ciphers and Power Analysis Attacks, Lecture Notes in Computer Science, pp.134-149, 1978.
DOI : 10.1007/3-540-44706-7_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.1116

J. Daemen and V. Rijmen, The Wide Trail Design Strategy, Lecture Notes in Computer Science, vol.2260, pp.222-238, 2001.
DOI : 10.1007/3-540-45325-3_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.2588

I. Dinur, O. Dunkelman, N. Keller, and A. Shamir, Key Recovery Attacks on 3- round Even-Mansour, 8-step LED-128, and Full AES 2 . Cryptology ePrint Archive, 2013.
DOI : 10.1007/978-3-642-42033-7_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.7504

O. Dunkelman, N. Keller, and A. Shamir, Minimalism in Cryptography: The Even-Mansour Scheme Revisited, Lecture Notes in Computer Science, vol.7237, pp.336-354, 2012.
DOI : 10.1007/978-3-642-29011-4_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.8836

S. Even and Y. Mansour, A Construction of a Cipher From a Single Pseudorandom Permutation, pp.210-224

B. Gérard, V. Grosso, M. Naya-plasencia, and F. X. Standaert, Block Ciphers That Are Easier to Mask: How Far Can We Go?, pp.383-399
DOI : 10.1007/978-3-642-40349-1_22

M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, 2007.

V. Grosso, F. X. Standaert, and S. Faust, Masking vs. Multiparty Computation: How Large Is the Gap for AES?, pp.400-416

J. Guo, I. Nikolic, T. Peyrin, and L. Wang, Cryptanalysis of Zorro, Cryptology ePrint Archive Report, vol.2013713713, 2013.

P. E. Hart, N. J. 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

H. Imai, R. L. Rivest, and T. Matsumoto, Advances in Cryptology -ASI- ACRYPT '91, International Conference on the Theory and Applications of Cryptology, Fujiyoshida, Japan, Proceedings, 1991.

Y. Ishai, A. Sahai, and D. Wagner, Private Circuits: Securing Hardware against Probing Attacks, Lecture Notes in Computer Science, vol.2729, pp.463-481, 2003.
DOI : 10.1007/978-3-540-45146-4_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.9436

T. Isobe and K. Shibutani, Security Analysis of the Lightweight Block Ciphers XTEA, LED and Piccolo, Lecture Notes in Computer Science, vol.7372, pp.71-86, 2012.
DOI : 10.1007/978-3-642-31448-3_6

E. Käsper and P. Schwabe, Faster and Timing-Attack Resistant AES-GCM, Lecture Notes in Computer Science, vol.5747, pp.1-17, 2009.
DOI : 10.1007/978-3-642-04138-9_1

S. Kerckhof, F. Durvaux, C. Hocquet, D. Bol, and F. X. Standaert, Towards Green Cryptography: A Comparison of Lightweight Ciphers from the Energy Viewpoint, Lecture Notes in Computer Science, vol.7428, pp.390-407, 2012.
DOI : 10.1007/978-3-642-33027-8_23

D. Khovratovich and I. Nikolic, Rotational Cryptanalysis of ARX, Lecture Notes in Computer Science, vol.6147, pp.333-346, 2010.
DOI : 10.1007/978-3-642-13858-4_19

H. Kim, S. Hong, and J. Lim, A Fast and Provably Secure Higher-Order Masking of AES S-Box, pp.95-107
DOI : 10.1007/978-3-642-23951-9_7

L. R. Knudsen, Fast Software Encryption, 6th International Workshop, FSE '99 Proceedings, 1999.
DOI : 10.1007/3-540-48519-8

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, On correlation between the order of S-boxes and the strength of DES, pp.366-375
DOI : 10.1007/BFb0053451

M. Matsui, New block encryption algorithm MISTY, pp.54-68
DOI : 10.1007/BFb0052334

F. Mendel, V. Rijmen, D. Toz, and K. Varici, Differential Analysis of the LED Block Cipher, Lecture Notes in Computer Science, vol.7658, pp.190-207, 2012.
DOI : 10.1007/978-3-642-34961-4_13

I. Nikolic, L. Wang, and S. Wu, Cryptanalysis of Round-Reduced LED, 2013.

S. Nikova, V. Rijmen, and M. Schläffer, Secure Hardware Implementation of Nonlinear Functions in the Presence of Glitches, Journal of Cryptology, vol.22, issue.11, pp.292-321, 2011.
DOI : 10.1007/s00145-010-9085-7

K. Nyberg, Linear approximation of block ciphers, pp.439-444
DOI : 10.1007/BFb0053460

G. Piret, T. Roche, and C. Carlet, PICARO ??? A Block Cipher Allowing Efficient Higher-Order Side-Channel Resistance, Lecture Notes in Computer Science, vol.7341, pp.311-328, 2012.
DOI : 10.1007/978-3-642-31284-7_19

E. Prouff and T. Roche, Higher-Order Glitches Free Implementation of the AES Using Secure Multi-party Computation Protocols, pp.63-78
DOI : 10.1007/978-3-642-23951-9_5

V. Rijmen and P. Barreto, Nessie proposal: WHIRLPOOL (2000) Available online at https

M. Rivain and E. Prouff, Provably Secure Higher-Order Masking of AES, Lecture Notes in Computer Science, vol.6225, pp.413-427, 2010.
DOI : 10.1007/978-3-642-15031-9_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.7885

A. D. Santis, Advances in Cryptology -EUROCRYPT '94, Workshop on the Theory and Application of Cryptographic Techniques, Proceedings, 1994.

T. Toffoli, Reversible computing, Lecture Notes in Computer Science, vol.85, pp.632-644, 1980.
DOI : 10.1007/3-540-10003-2_104

M. Ullrich, C. D. Cannì-ere, S. Indesteege, ¨. O. Küçük, N. Mouha et al., Finding Optimal Bitsliced Implementations of 4 x 4-bit S-boxes, Symmetric Key Encryption Workshop, p.20, 2011.

N. Veyrat-charvillon, B. Gérard, and F. X. Standaert, Security Evaluations beyond Computing Power, Lecture Notes in Computer Science, vol.7881, pp.126-141, 2013.
DOI : 10.1007/978-3-642-38348-9_8
URL : http://hdl.handle.net/2078.1/133720

D. Wagner, The Boomerang Attack, pp.156-170
DOI : 10.1007/3-540-48519-8_12

C. Whitnall, E. Oswald, and F. X. Standaert, The Myth of Generic DPA???and the Magic of Learning, Lecture Notes in Computer Science, vol.8366, pp.183-205, 2014.
DOI : 10.1007/978-3-319-04852-9_10