Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

APPROX
2009
Springer

favoriteEmaildiscussreport

87views Algorithms» more APPROX 2009»

Pseudorandom Bit Generators That Fool Modular Sums

13 years 11 months ago

Pseudorandom Bit Generators That Fool Modular Sums

Download people.seas.harvard.edu

Shachar Lovett, Omer Reingold, Luca Trevisan, Sali

Real-time Traffic

Algorithms | APPROX 2009 |

claim paper

Related Content

» Pseudorandom Bits for Polynomials

» Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates

» An Improved Pseudorandom Generator Based on Discrete Log

» Pseudorandom generators for low degree polynomials

» Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits

» Automatic Generation of Modular Multipliers for FPGA Applications

» On the Insecurity of Stream Ciphers Based on Arrays and Modular Addition

» On the Exact Space Complexity of Sketching and Streaming Small Norms

Post Info
More Details (n/a)

Added	25 May 2010
Updated	25 May 2010
Type	Conference
Year	2009
Where	APPROX
Authors	Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan

Comments (0)