Sciweavers

13 search results - page 1 / 3
» Generic Attacks on Feistel Networks with Internal Permutatio...
Sort
View
AFRICACRYPT
2009
Springer
13 years 11 months ago
Generic Attacks on Feistel Networks with Internal Permutations
Joana Treger, Jacques Patarin
ASIACRYPT
2007
Springer
13 years 10 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
2006
Springer
13 years 8 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...
CRYPTO
2010
Springer
151views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks
Abstract. A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with e...
Yevgeniy Dodis, Krzysztof Pietrzak
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
13 years 9 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