406 search results - page 3 / 82 » Pseudorandomness and Combinatorial Constructions |
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
CRYPTO
2001
Springer
14 years 2 months ago
2001
Springer
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
STOC
1994
ACM
14 years 1 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
FSE
2001
Springer
14 years 2 months ago
2001
Springer
In this paper, we describe new results on the security, in the Luby-Rackoff paradigm, of two modified Feistel constructions, namely the L-scheme, a construction used at various l...
STOC
2010
ACM
14 years 1 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 ...