406 search results - page 4 / 82 » Pseudorandomness and Combinatorial Constructions |
EUROCRYPT
2006
Springer
14 years 2 months ago
2006
Springer
The Feistel-network is a popular structure underlying many block-ciphers where the cipher is constructed from many simpler rounds, each defined by some function which is derived fr...
ECCC
1998
13 years 10 months ago
1998
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
CC
2005
Springer
13 years 10 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
TCC
2012
Springer
12 years 6 months ago
2012
Springer
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...