247 search results - page 28 / 50 » On Pseudorandom Generators in NC |
TCC
2009
Springer
14 years 8 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...
LATINCRYPT
2010
13 years 6 months ago
2010
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
EUROCRYPT
2004
Springer
14 years 28 days ago
2004
Springer
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...
FSKD
2005
Springer
14 years 1 months ago
2005
Springer
The development of CAM system for design and manufacturing of end mills becomes a key approach to save the time and reduce cost for end mills manufacturing. This paper presents the...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...