406 search results - page 9 / 82 » Pseudorandomness and Combinatorial Constructions |
IACR
2011
14 years 8 days ago
2011
Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i....
73
Voted
DM
2008
15 years 21 days ago
2008
A covering array CA(N; t, k, v) is an N
95
Voted
EUROCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
A weak pseudorandom function (wPRF) is a cryptographic primitive similar to ? but weaker than ? a pseudorandom function: for wPRFs one only requires that the output is pseudorandom...
124
Voted
STOC
2005
ACM
16 years 28 days ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
127
click to vote
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...