How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

Manuel Blum, Silvio Micali

Type: Article

Publication Date: 1984-11-01

Citations: 1371

DOI: https://doi.org/10.1137/0213053

View Publication

Locations

SIAM Journal on Computing - View

Similar Works

Action	Title	Year	Authors
+	Cryptology and number sequences: Pseudorandom, random, and perfectly random	1984	Sig Porter
+ PDF Chat	How to construct random functions	1986	Oded Goldreich Shafi Goldwasser Silvio Micali
+	High-Speed Pseudorandom Number Generation with Small Memory	1999	William Aiello S. Rajagopalan Ramarathnam Venkatesan
+	Pseudo-random generators for all hardnesses	2005	C. Umans
+	Pseudorandom Strings from Pseudorandom Quantum States	2023	Prabhanjan Ananth Yao-Ting Lin Henry Yuen
+	Practical private randomness generation	2011	Stefano Pironio Serge Massar
+	Polynomial-Time Pseudodeterministic Construction of Primes	2023	Lijie Chen Zhenjian Lu Igor Carboni Oliveira Hanlin Ren Rahul Santhanam
+	Pseudo-Deterministic One-Way Functions from Pseudorandom States	2023	Mohammed Barhoush Louis Salvail
+ PDF Chat	Simple extractors via constructions of cryptographic pseudo-random generators	2009	Marius Zimand
+	Pseudorandom Bits and Sequences	2018	Alfred Menezes Paul C. van Oorschot Scott A. Vanstone
+	Pseudorandom Bits and Sequences	2018	Alfred Menezes Paul C. van Oorschot Scott A. Vanstone
+	Pseudorandom Bits and Sequences	1996
+	Impossibility and Optimality Results on Constructing Pseudorandom Permutations	2007	Yuliang Zheng Tsutomu Matsumoto Hideki Imai
+ PDF Chat	Polynomial-Time Pseudodeterministic Construction of Primes	2023	Lijie Chen Zhenjian Lu Igor Carboni Oliveira Hanlin Ren Rahul Santhanam
+	On the Existence of Pseudorandom Generators	1993	Oded Goldreich Hugo Krawczyk Michael Luby
+	The Guessing Secrets problem: a probabilistic approach	2004	Alberto Del Lungo Guy Louchard Claudio Marini Franco Montagna
+	SP 800-90A. Recommendation for Random Number Generation Using Deterministic Random Bit Generators	2012	Elaine B. Barker John Kelsey
+	Simple extractors via constructions of cryptographic pseudo-random generators	2005	Marius Zimand
+	Randen - fast backtracking-resistant random generator with AES+Feistel+Reverie	2018	Emmanuel Mogenet Jan Wassenberg Jyrki Alakuijala Robert Obryk
+	Generating deterministically certified primes	1994

Works That Cite This (194)

Action	Title	Year	Authors
+ PDF Chat	The Monte Carlo Algorithm with a Pseudorandom Generator	1992	J. F. Traub H. Wozniakowski
+ PDF Chat	Pseudorandomness for Approximate Counting and Sampling	2006	Ronen Shaltiel Christopher Umans
+ PDF Chat	How to construct random functions	2019	Oded Goldreich Shafi Goldwasser Silvio Micali
+	Random Walks and Rapid Mixing	2011	Cristopher Moore Stephan Mertens
+	Adaptively secure multi-party computation	1996	Ran Canetti Uri Feige Oded Goldreich Moni Naor
+	On the Existence of Pseudorandom Generators	1993	Oded Goldreich Hugo Krawczyk Michael Luby
+ PDF Chat	Sub-computable Boundedness Randomness	2014	Sam Buss Douglas Cenzer Jeffrey B. Remmel
+	Limits on the provable consequences of one-way permutations (invited talk)	1990	Russell Impagliazzo Steven Rudich
+	An Average Case NP-complete Graph Problem	2001	Leonid A. Levin Ramarathnam Venkatesan
+	Random instances of a graph coloring problem are hard	1988	Ramarathnam Venkatesan Leonid A. Levin

Works Cited by This (3)

Action	Title	Year	Authors
+ PDF Chat	Approximate formulas for some functions of prime numbers	1962	J. Barkley Rosser Lowell Schoenfeld
+	Solved and Unsolved Problems in Number Theory.	1964	W. J. LeVeque Daniel Shanks
+	Theory and application of trapdoor functions	1982	Andrew Chi-Chih Yao