S. Chen and J. P. Steinberger, Tight Security Bounds for Key-Alternating Ciphers, Advances in Cryptology -EUROCRYPT '14, vol.8441, pp.237-350, 2014.

B. Cogliati, J. Patarin, and Y. Seurin, Security Amplification for the Composition of Block Cipher: Simpler Proofs and New Results. Selected Areas in Cryptography-SAC '14, Lecture Notes in Computer Science, vol.8781, pp.129-146, 2014.

V. T. Hoang and P. Rogaway, On Generalized Feistel Networks, Advances in Cryptology -CRYPTO 2010, Tal Rabin, vol.6223, pp.613-630, 2010.

V. T. Hoang and S. Tessaro, Key-Alternating Ciphers and Key-Length extension: Exact bounds and Multi-User Security, Advances in Cryptology -CRYPTO 2016, vol.9814, pp.3-32, 2016.

R. Lampe, J. Patarin, and Y. Seurin, An Asymptotically Tight Security Analysis of the Iterated Advances in Cryptology -ASIACRYPT 2012, vol.7658, pp.278-295, 2012.

R. Lampe and Y. Seurin, Tweakable Blockciphers with Asymptotically Optimal Security, Fast Software Encryption -FSE 2013, S. Moriai, vol.8424, pp.133-146, 2013.

R. Lampe and Y. Seurin, Security Analysis of Key-Alternating Feistel Ciphers. Fast Software Encryption -FSE 2013, vol.840, pp.243-264, 2014.

M. Luby and C. Rackoff, How to construct pseudo-random permutations from pseudorandom functions, SIAM Journal on Computing, vol.17, pp.373-386, 1988.

U. ;. Maurer and L. R. Knudsen, Indistinguishability of Random Systemes, Advances in Cryptology -EUROCRYPT '02, p.2332, 2002.

U. Maurer and K. Pietrzak, The Security of Many-Round Luby-Rackoff PseudoRandom Permutations, Advances in Cryptology -EUROCRYPT '03, pp.544-561, 2003.

U. Maurer and K. Pietrzak, Composition of Random Systems: When Two Weak Make One Strong, Theory of Cryptography -TCC '04, Naor, M, p.2951, 2004.

U. Maurer, K. Pietrzak, and R. Renner, Indistinguishability Amplification. Advances in Cryptology -CRYPTO '07, A. Menezes, vol.4622, pp.130-149, 2007.

I. Mironov, Not So) Random Shuffles of RC4, Advances in Cryptology -CRYPTO '02, p.2442, 2002.

B. Morris, P. Rogaway, and T. Stegers, How to Encipher Messages on a Small Domain, Advances in Cryptology -CRYPTO '09, vol.5677, pp.286-302, 2009.

S. Myers, Black-Box Composition Does Not Imply Adaptive Security, Advances in Cryptology -EUROCRYPT '04, vol.3027, pp.189-206, 2004.

J. Patarin, Étude des Générateurs de Permutations Pseudo-aléatoires basés sur le schéma du, 1991.

J. Patarin, The "coefficient H" technique. Selected Areas in Cryptography -SAC '08, Lecture Notes in Computer Science, vol.5381, pp.328-345, 2009.

J. Patarin, Security of Balanced and Unbalanced Feistel Schemes with Linear Non Equalities, Cryptology ePrint Archive, p.293, 2010.

K. Pietrzak, Composition Does Not Imply Adaptive Security, Advances in Cryptology -CRYPTO '05, vol.3621, pp.55-65, 2005.

S. Tessaro, Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma, Theory of Cryptography -TCC '11, vol.6597, pp.37-54, 2011.