331 search results - page 5 / 67 » New Results on the Pseudorandomness of Some Blockcipher Cons... |
CCS
2010
ACM
13 years 9 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...
IACR
2011
12 years 8 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
CORR
2011
Springer
13 years 18 days ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
DM
2008
13 years 9 months ago
2008
LR design is introduced by the second author in his recent paper, and it plays a very important role in the construction of LKTS (a large set of disjoint Kirkman triple system). I...