Extractors and pseudo-random generators with optimal seed length

DOI10.1145/335305.335306zbMath1296.65007OpenAlexW2070437169MaRDI QIDQ3191965

Avi Wigderson, Ronen Shaltiel, Russell Impagliazzo

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335306

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (6)

Reconstructive dispersers and hitting set generators ⋮ Pseudorandom generators without the XOR lemma ⋮ Extractors from Reed-Muller codes ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors ⋮ Pseudo-random generators for all hardnesses ⋮ Randomness vs time: Derandomization under a uniform assumption

This page was built for publication: Extractors and pseudo-random generators with optimal seed length