Pseudo-random generators for all hardnesses

Type: Article

Publication Date: 2005-08-25

Citations: 0

DOI: https://doi.org/10.1109/ccc.2002.1004326

Similar Works

Action Title Year Authors
+ Practical private randomness generation 2011 Stefano Pironio
Serge Massar
+ Impossibility and Optimality Results on Constructing Pseudorandom Permutations 2007 Yuliang Zheng
Tsutomu Matsumoto
Hideki Imai
+ PDF Chat Randomness for Free 2010 Krishnendu Chatterjee
Laurent Doyen
Hugo Gimbert
Thomas A. Henzinger
+ Extracting randomness within a subset is hard 2019 Bjørn Kjos-Hanssen
Lu Liu
+ Random Cnf’s are Hard for the Polynomial Calculus 2010 Eli Ben‐Sasson
Russell Impagliazzo
+ Pseudo-random number generators based on the Collatz conjecture 2019 David Xu
Dan E. Tamir
+ Computer Programs: A Runs Test for Sample Non-Randomness 1975 A. Raouf
Prachi Sathe
John S. White
+ Randomness Extractors -- An Exposition 2016 Wei‐Min Dai
+ PDF Chat Bad oracles in higher computability and randomness 2021 Laurent Bienvenu
Noam Greenberg
Benoît Monin
+ On Hardness Assumptions Needed for "Extreme High-End'' PRGs and Fast Derandomization 2023 Ronen Shaltiel
Emanuele Viola
+ On randomness extractors 2010 Oded Goldreich
+ Shared generation of pseudo-random functions 2004 Huaxiong Wang
Josef Pieprzyk
+ PDF Chat Derandomization with Pseudorandomness 2024 Emin Karayel
+ Generating deterministically certified primes 1994
+ Pseudorandom numbers 2001 Saul I. Gass
Carl M. Harris
+ Gambling tests for pseudorandom number generators 2001 Stefan Wegenkittl
+ A New Exact Runs Test for Randomness 1992 Marilyn A. Agin
Anant P. Godbole
+ One-way functions and pseudo-random generators 2004
+ PDF Chat Do most strong definitions of randomness exist? 1998 Bruno Durand
Vladimir Kanovei
Vladimir Uspensky
Nikolai Vereshagin
+ Chapter 9. Pseudorandom numbers 2009 Vladimir Anashin
Andrei Khrennikov

Works That Cite This (0)

Action Title Year Authors