Sciweavers

Share
64 search results - page 1 / 13
» Generic Attacks on Feistel Schemes
Sort
View
ASIACRYPT
2001
Springer
11 years 5 months ago
Generic Attacks on Feistel Schemes
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:
Jacques Patarin
ASIACRYPT
2006
Springer
11 years 5 months ago
Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
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 ...
Jacques Patarin, Valérie Nachef, Côme...
ASIACRYPT
2007
Springer
11 years 7 months ago
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
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...
Jacques Patarin, Valérie Nachef, Côme...
ASIACRYPT
2010
Springer
10 years 11 months ago
Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
Emmanuel Volte, Valérie Nachef, Jacques Pat...
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
11 years 6 months ago
Security of Random Feistel Schemes with 5 or More Rounds
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...
Jacques Patarin
books