Fast Primality Tests for Numbers Less Than 50 ⋅10 9

G. C. Kurtz, Daniel Shanks, Hywel C Williams

Type: Article

Publication Date: 1986-04-01

Citations: 8

DOI: https://doi.org/10.2307/2008007

View Publication

Locations

Mathematics of Computation - View

Similar Works

Action	Title	Year	Authors
+	Carmichael numbers and a new primality test	2010	Joao Carlos Leandro da Silva
+	Four primality testing algorithms	2008	René Schoof
+	Four primality testing algorithms	2008	René Schoof
+ PDF Chat	Strong Primality Tests that are Not Sufficient	1982	William H. Adams Daniel Shanks
+ PDF Chat	Finding strong pseudoprimes to several bases	2000	Zhenxiang Zhang
+	Fast Algorithms on Primality Testing for Numbers 255 ⋅ 2^n ± 1	2019	Dandan Huang Zheng Zhang Zhihao Gavin Tang
+	Primality Testing for Numbers of the Form h · 2n ± 1	2019	Dandan Huang Yunling Kang
+ PDF Chat	Pseudoprimes for Higher-Order Linear Recurrence Sequences	1990	S. Gurak
+	1. Introduction: Efficient Primality Testing	2004	Martin Dietzfelbinger
+ PDF Chat	A Simple Algorithm for Prime Factorization and Primality Testing	2022	Kabenge Hamiss
+	On cyclotomic primality tests	2011	Thomas Francis Boucher
+ PDF Chat	Pseudoprimes for higher-order linear recurrence sequences	1990	S. Gurak
+	Quintic Reciprocity and Primality Test for Numbers of the Form $M~=~A5^{n} \pm ~\omega_{n}$	2000	Pedro Berrizbeitia Mauricio Odreman-Vera Juan Tena Ayuso
+	On the Number of Primality Witnesses of Composite Integers	2021	B. G. Mubarakov
+	On the number of primality witnesses of composite integers	2021	Bulat Gazinorovich Mubarakov
+ PDF Chat	Finding strong pseudoprimes to several bases. II	2003	Zhenxiang Zhang Min Tang
+	An open source software package for primality testing of numbers of the form p2^n+1, with no constraints on the relative sizes of p and 2^n	2018	Tejas R. Rao
+	An open source software package for primality testing of numbers of the form p2^n+1, with no constraints on the relative sizes of p and 2^n	2018	Tejas R. Rao
+	Prime Numbers: A Computational Perspective	2012	Richard E. Crandall Carl Pomerance
+ PDF Chat	METHOD OF TESTING LARGE NUMBERS FOR PRIMALITY	2024	Vladimir Pevnev Oles Yudin Peter Sedlaček Nina Kuchuk

Works That Cite This (7)

Action	Title	Year	Authors
+ PDF Chat	A Probable Prime Test with Very High Confidence for n ≡ 1 mod 4	2001	Siguna Müller
+ PDF Chat	Pseudoprimes for higher-order linear recurrence sequences	1990	S. Gurak
+	Pseudoprimes: A Survey of Recent Results	1993	François Morain
+ PDF Chat	A note on Perrin pseudoprimes	1991	Steven Arno
+ PDF Chat	On the number of elliptic pseudoprimes	1989	Daniel M. Gordon
+ PDF Chat	Frobenius pseudoprimes	2000	Jon Grantham
+ PDF Chat	Characterizing pseudoprimes for third-order linear recurrences	1987	William W. Adams

Works Cited by This (3)

Action	Title	Year	Authors
+ PDF Chat	The pseudoprimes to 25⋅10⁹	1980	Carl Pomerance J. L. Selfridge Samuel S. Wagstaff
+ PDF Chat	Characterizing pseudoprimes for third-order linear recurrences	1987	William W. Adams
+ PDF Chat	Strong primality tests that are not sufficient	1982	William W. Adams Daniel Shanks