131 search results - page 2 / 27 » The complexity of constructing pseudorandom generators from ... |
STOC
2010
ACM
13 years 9 months ago
2010
ACM
We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of ...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
ECCC
1998
13 years 5 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
COCO
2005
Springer
13 years 11 months ago
2005
Springer
ASIACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...