Pseudorandom Bit Generators That Fool Modular Sums

DOI10.1007/978-3-642-03685-9_46MaRDI QIDQ3638908zbMATH OpenOpenAlexFDO

Authors Shachar Lovett, Omer Reingold, Luca Trevisan, Salil Vadhan

Publication date 28 October 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03685-9_46

Mathematics Subject Classification ID

Randomized algorithms (68W20) Random walks on graphs (05C81)

Recommendations

• Pseudorandom generators for low degree polynomials
• Pseudorandom bits for polynomials
• Pseudorandom generators for space-bounded computation
• Pseudorandomness via the discrete Fourier transform
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Cited in

(11)

• Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields
• Pseudorandom generators for combinatorial checkerboards
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• Improved bounds for quantified derandomization of constant-depth circuits and polynomials
• Entropy of weight distributions of small-bias spaces and pseudobinomiality
• Pseudo-random bit generator based on multi-modal maps
• Pseudorandom generators for combinatorial shapes
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Pseudorandomness via the discrete Fourier transform
• Small-bias is not enough to hit read-once CNF
• Modular constructions of pseudorandom binary sequences with composite moduli

This page was built for publication: Pseudorandom Bit Generators That Fool Modular Sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638908)