Close to Uniform Prime Number Generation with Fewer Random Bits

Pierre-Alain Fouque, Mehdi Tibouchi

Type: Book-Chapter

Publication Date: 2014-01-01

Citations: 4

DOI: https://doi.org/10.1007/978-3-662-43948-7_82

View Publication

Download PDF

Locations

Lecture notes in computer science - View
arXiv (Cornell University) - View - PDF
CiteSeer X (The Pennsylvania State University) - View - PDF
HAL (Le Centre pour la Communication Scientifique Directe) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Close to Uniform Prime Number Generation With Fewer Random Bits	2018	Pierre-Alain Fouque Mehdi Tibouchi
+ PDF Chat	The generation of random numbers that are probably prime	1988	Pierre Beauchemin Gilles Brassard Claude Crépeau Claude Goutier Carl Pomerance
+ PDF Chat	Statistical Evidence for Small Generating Sets	1993	Eric Bach Lorenz Huelsbergen
+	An Algorithm to Generate Random Factored Smooth Integers	2020	Eric Bach Jonathan Sorenson
+	An Algorithm to Generate Random Factored Smooth Integers.	2020	Eric Bach Jonathan Sorenson
+	How to Generate Factored Random Numbers	1988	Eric Bach
+	The set of primes: Towards an optimized algorithm, prime generation and validation, and asymptotic consequences	2008	Gerardo Iovane
+	Polynomial-Time Pseudodeterministic Construction of Primes	2023	Lijie Chen Zhenjian Lu Igor Carboni Oliveira Hanlin Ren Rahul Santhanam
+	Deterministic methods to find primes	2011	Terence Tao Ernest S. Croot H. A. Helfgott
+	Algorithms for Generating, Testing and Proving Primes: A Survey	2001	Preda Mihăilescu
+	Fast verification, testing, and generation of large primes	1979	David A. Plaisted
+	Random Sieving and the Prime Number Theorem	1974	Karl Greger
+ PDF Chat	Polynomial-Time Pseudodeterministic Construction of Primes	2023	Lijie Chen Zhenjian Lu Igor Carboni Oliveira Hanlin Ren Rahul Santhanam
+	Primality testing with fewer random bits	1993	René Peralta Victor Shoup
+ PDF Chat	Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes	1989	J. Pintz William Steiger Endre Szemerédi
+	The Prime Distribution	1986	Manfred R. Schroeder
+	The Prime Distribution	1984	Manfred R. Schroeder
+	The Prime Distribution	1997	Manfred R. Schroeder
+	3. Fundamentals from Number Theory	2004	Martin Dietzfelbinger
+ PDF Chat	The Power of Two Random Choices: A Survey of Techniques and Results	2001	Michael Mitzenmacher Andréa W. Richa Ramesh K. Sitaraman

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Close to Uniform Prime Number Generation with Fewer Random Bits	2014	Pierre-Alain Fouque Mehdi Tibouchi

Works Cited by This (24)

Action	Title	Year	Authors
+ PDF Chat	A Computational Introduction to Number Theory and Algebra	2008	Victor Shoup
+	Multiplicative Number Theory	1980	H. Davenport
+	Fast Generation of Provable Primes Using Search in Arithmetic Progressions	2007	Preda Mihăilescu
+	Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity	2007	Ueli Maurer
+	On Generation of Probable Primes by Incremental Search	2007	Jørgen Brandt Ivan Damgård
+	Topics in Multiplicative Number Theory	1971	Hugh L. Montgomery
+	How to Generate Factored Random Numbers	1988	Eric Bach
+	THE 'LARGE SIEVE' METHOD AND ITS APPLICATIONS IN THE THEORY OF NUMBERS	1966	M. B. Barban
+ PDF Chat	Fast generation of prime numbers and secure public-key cryptographic parameters	1995	Ueli Maurer
+	Limitations to the equi-distribution of primes. IV	1991	John Friedlander Andrew Granville