Sciweavers

247 search results - page 24 / 50
» On Pseudorandom Generators in NC
Sort
View
DCC
2007
IEEE
14 years 7 months ago
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
Jaime Gutierrez, Álvar Ibeas
NDSS
2009
IEEE
14 years 2 months ago
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
Michael Backes, Peter Druschel, Andreas Haeberlen,...
PDP
2007
IEEE
14 years 1 months ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
Andreas Beckmann, Jorg Keller
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 2 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
ICDAR
2005
IEEE
14 years 1 months ago
ScatterType: A Legible but Hard-to-Segment CAPTCHA
The ScatterType CAPTCHA, designed to resist character– segmentation attacks and shown to be highly legible to human readers, is analyzed for vulnerabilities and is offered for e...
Henry S. Baird, Michael A. Moll, Sui-Yu Wang