Random Feistel Schemes: security in m <<2^{3n/4} for >= 6 rounds

Design of near - optimal pseudorandom functions and pseudorandom permutations in the information - theoretic model

Generic Attacks on Feistel Schemes (Extended Version)

Generic Attacks on Feistel Schemes (Eprint Version)

Luby-Rackoff: 7 Rounds are Enough for 2^{n-epsilon} Security

Luby-Rackoff: 5 Rounds are Enough for 2^{n-epsilon} Security

Generic attacks on unbalanced Feistel Schemes with Expanding functions

Analysis of Intermediate Field Systems

A proof of secutity in O(2^n) for the Benes Scheme

A proof of security in O(2^n) for the Xor of two random permutations

Building Secure Block Ciphers Attacks Assumptions

The coefficient H technique

The random Oracle Model and the Ideal Cipher Model are equivalent

t-resilient functions and the partial exposure problem

Generic Attacks on Feistel Networks with internal Permutations

QUAD: a multivariate stream cipher with provable security.

Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions

I shall love you until death (Marie Antoinette to Axel von Fersen)

Transfinite Cryptography

Indifferentiability beyond the birthday bound for the xor of two public permutations

Generic Attacks on Misty Schemes

Some transfinite generalizations of Gödel's incompletness theorem