Abstract
Some deterministic and Las Vegas primality tests are presented. Under certain conditions, they run in polynomial time. In particular, there is a polynomial time Las Vegas algorithm deciding primality of n, when n hat at most 2 prime factors and n \(\mathop \mp \limits^ + \)1 mod 24.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L.M. Adleman, C. Pomerance and R.S. Rumely, On distinguishing Prime Numbers from Composite Numbers. Annals of Math. 117 (1983), 173–206.
N.C. Ankeny, The Least Quadratic Non-Residue. Annals of Math. 55 (1952), 65–72.
E. Bach, Fast Algorithms under the Extended Riemann Hypothesis: A Concrete Estimate. 14th STOC (1982), 290–295.
N.G. de Bruijn, On the Number of Positive Integers ≤ x and Free of Prime Factors > y, II. Proc. Koninklijke Nederlandse Akademie van Wettenschappen. Ser. A 69 (=Indag.Math.28) (1966), 239–247.
H. Cohn, Advanced Number Theory. Dover, New York, 1980.
G.H. Hardy and E.M. Wright, An Introduction to the Theory of Numbers. Oxford University Press, Oxford, 1979.
D.E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading, 1981.
S. Lang, Algebra. Addison-Wesley, Reading, 1984.
D.H. Lehmer, An Extended Theory of Lucas'Functions. Annals of Math. 31 (1930), 419–448.
E. Lucas, Théorie des fonctions numériques simplement périodiques. Amer. J. Math 1 (1878), 184–239, 289–321.
G.L. Miller, Riemann's Hypothesis and Tests for Primality. J. of Computer and System Sciences 13 (1976), 300–317.
K.K. Norton, Numbers with Small Prime Factors, and the Least k-th Power Non-Residue. Memoirs of the AMS No. 106, 1971.
J. Oesterlé, Versions effectives du théorème de Chebotarew sous l'hypothèse de Riemann généralisée, Journées Arithmétiques de Luminy, Astérisque 61 (1979), 165–167.
D.A. Plaisted, Fast Verification, Testing and Generation of Large Primes. Theoretical Computer Science 9 (1979), 1–16.
K. Prachar, Primzahlverteilung. Springer, Berlin, 1957.
M.O. Rabin, Probabilistic Algorithm for Testing Primality. J. of Number Theory 12 (1980), 128–138.
C.L. Siegel, Ueber die Classenzahl quadratischer Zahlkörper. Acta Arithm. 1 (1935), 83–86.
R. Solovay and V. Strassen, A Fast Monte-Carlo Test for Primality. SIAM J. on Computing 6 (1977), 84–85.
I.N. Stewart and D.O. Tall, Algebraic Number Theory. Chapman and Hall, London, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fürer, M. (1985). Deterministic and Las Vegas primality testing algorithms. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015745
Download citation
DOI: https://doi.org/10.1007/BFb0015745
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive