45 search results - page 2 / 9 » On Constructing Parallel Pseudorandom Generators from One-Wa... |
ASIACRYPT
2001
Springer
13 years 9 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...
CRYPTO
2001
Springer
13 years 9 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...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
ICALP
2005
Springer
13 years 10 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...
CCS
2010
ACM
13 years 5 months ago
2010
ACM
We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic NaorReingold algebraic PRF. Our PRF is the result of adapting the cascade constructio...