论文信息 - Proof Beyond the Birthday Bound with the Coupling Technique

Proof Beyond the Birthday Bound with the Coupling Technique

The coupling technique originates from the theory of Markov chains, and allows to upper bound the rate at which a Markov chain approaches its stationary distribution. Recasting the encryption process of a tuple of plaintexts through an iterative block cipher as a Markov chain, it is possible to use this tool to upper bound the advantage of a distinguisher against various kinds of Feistel schemes.

Valérie Nachef | Jacques Patarin | Emmanuel Volte

[1] Yannick Seurin,et al. An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher , 2012, ASIACRYPT.

[2] Phillip Rogaway,et al. How to Encipher Messages on a Small Domain , 2009, CRYPTO.

[3] Benoit Cogliati,et al. Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results , 2014, Selected Areas in Cryptography.

[4] Yannick Seurin,et al. Security Analysis of Key-Alternating Feistel Ciphers , 2014, FSE.

[5] D. Aldous. Random walks on finite groups and rapidly mixing markov chains , 1983 .

[6] Yannick Seurin,et al. Tweakable Blockciphers with Asymptotically Optimal Security , 2013, FSE.

[7] E. Thorp. Nonrandom Shuffling with Applications to the Game of Faro , 1973 .

[8] Ilya Mironov,et al. (Not So) Random Shuffles of RC4 , 2002, IACR Cryptol. ePrint Arch..

[9] Phillip Rogaway,et al. On Generalized Feistel Networks , 2010, CRYPTO.

[10] Ueli Maurer,et al. Indistinguishability Amplification , 2007, CRYPTO.