64 search results - page 1 / 13 » Generic Attacks on Feistel Schemes |
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A:
ASIACRYPT
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we describe generic attacks on unbalanced Feistel schemes with contracting functions. These schemes are used to construct pseudo-random permutations from kn bits to ...
ASIACRYPT
2007
Springer
13 years 10 months ago
2007
Springer
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
ASIACRYPT
2010
Springer
13 years 2 months ago
2010
Springer
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...