Two infinite sets of primes with fast primality tests

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes	1989	J. Pintz William Steiger Endre Szemerédi
+	Primality testing for beginners	2014	Lasse Rempe Rebecca Waldecker
+	Prime numbers are of fundamental importance in mathematics in general, and cryptography theory in particular. Efficient primality tests are also useful in practice: a number of cryptographic protocols need big prime	2006	Roman Popovych
+ PDF Chat	Infinite sets of primes with fast primality tests and quick generation of large primes	1989	J. Pintz William Steiger Endre Szemerédi
+	Sharpening "Primes is in P" for a large family of numbers	2002	Pedro Berrizbeitia
+	Fast verification, testing, and generation of large primes	1979	David A. Plaisted
+	Deterministic methods to find primes	2011	Terence Tao Ernest S. Croot H. A. Helfgott
+	As opposed to prime factorization, primality testing is determining whether a given number is a prime, without necessarily computing its factorization. This lecture will study in details Solovay-Strassen algorithm for primality testing, discuss random primes generation and present one of its applications to cryptography.	2010	Baljak Valentina
+	Generating deterministically certified primes	1994
+	Deterministic methods to find primes	2010	D. H. J. Polymath
+	Fast Generation of Safe Primes using Deterministic Primality Tests based on Maurer Method	2006	Kumakyu Hidehiro Niwa Akito
+ PDF Chat	Primality testing and construction of large primes	2006	О. Н. Василенко
+	The set of primes: Towards an optimized algorithm, prime generation and validation, and asymptotic consequences	2008	Gerardo Iovane
+ PDF Chat	Primality test and primes enumeration using odd numbers indexation	2020	Wolf Marc François Wolf
+	Prime Numbers: A Computational Perspective	2012	Richard E. Crandall Carl Pomerance
+	Επώνυμοι πρώτοι αριθμοί ΙΙ	2011	Μαρία Κ. Βαρλάμου
+ PDF Chat	A quantum primality test with order finding	2017	Alvaro Donis-Vela Juan Carlos García‐Escartín
+ PDF Chat	A quantum primality test with order finding	2017	Alvaro Donis-Vela Juan Carlos García-Escartin
+	Deterministic Primality Testing - understanding the AKS algorithm	2013	Vijay Menon
+ PDF Chat	Fast generation of prime numbers and secure public-key cryptographic parameters	1995	Ueli Maurer

Works That Cite This (2)

Action	Title	Year	Authors
+	Open problems in number theoretic complexity, II	1994	Leonard M. Adleman Kevin S. McCurley
+	Some consequences of the existence of pseudorandom generators	1989	Eric Allender

Works Cited by This (6)

Action	Title	Year	Authors
+	Recognizing primes in random polynomial time	1987	Leonard M. Adleman Ming-Deh A. Huang
+	Almost all primes can be quickly certified	1986	S. Goldwasser Joe Kilian
+	On Distinguishing Prime Numbers from Composite Numbers	1983	Leonard M. Adleman Carl Pomerance Robert Rumely
+ PDF Chat	On prime numbers in an arithmetic progression with a prime-power difference	1964	M. B. Barban Yu. Linnik N. Tshudakov
+ PDF Chat	Topics in Multiplicative Number Theory	1971	Hugh L. Montgomery
+ PDF Chat	Large values of Dirichlet polynomials	1973	M. N. Huxley