Sciweavers

13214 search results - page 8 / 2643
» Pseudorandomness for network algorithms
Sort
View
FOCS
2000
IEEE
15 years 4 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
SAC
2008
ACM
14 years 11 months ago
Synchronization of strongly pulse-coupled oscillators with refractory periods and random medium access
The weakly pulse-coupled oscillator framework has proven to be a valuable resource for the development of peer-to-peer synchronization algorithms [9]. But leveraging it in a pract...
Julius Degesys, Prithwish Basu, Jason Redi
IACR
2011
115views more  IACR 2011»
13 years 11 months ago
Pseudorandom Functions and Lattices
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
Abhishek Banerjee, Chris Peikert, Alon Rosen
CATS
2008
15 years 1 months ago
On the Efficiency of Pollard's Rho Method for Discrete Logarithms
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
Shi Bai, Richard P. Brent
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
15 years 12 months ago
Pseudorandom generators for low degree polynomials
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...
Andrej Bogdanov