Primality testing revisited

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Primality testing revisited

Full text

Pdf (711 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Papers from the international symposium on Symbolic and algebraic computation table of contents

Berkeley, California, United States

Pages: 123 - 129

Year of Publication: 1992

ISBN:0-89791-489-9

Author

J. H. Davenport

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 56, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/143242.143290 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Alford et al., 1992	Alford,W.R., Granville,A. ~ Pomerance,C., There are Infinitely Many Carmichael Numbers. Preprint, 1992.
	Arnault, 1991	Arnault,F., Le Test de Primalit~ de Rabin-Miller: Un hombre compos~ qui le "passe". Report 61, Universit~ de Poitiers D~partement de Mathfimatiques, November 1991.
	Damgård & Landrock, 1991	Damg~rd,I. ~ Landrock,P., Improved Bounds for the Rabin Primality Test. To appear in Proc. 3rd IMA conference on Coding and Cryptography, ed. M. Ganley, OUP.
	Davenport & Smith, 1987	Davenport,J.H. ~ Snfith, G.C., Rabin's Primality Testing Algorithm ~ a Group Theory View. University of Bath Technical Report 87-04.
	Jaeschke, 1991	Jaeschke,G., Private Communication. April 1991.
	Koblitz, 1987	Neal Koblitz, A course in number theory and cryptography, Springer-Verlag New York, Inc., New York, NY, 1987
	Leech, 1992	Leech,J., Private Communication. 18 March and 7 April, 1992.
	Lenstra, 1981	Lenstra,H.W.,Jr., Primality Testing Algorithms (after Adleman, Rumely and Pomerance). S~minaire Bourbaki 1980/81 (Springer Lecture Notes in Mathematics 901, Springer-Verlag, Berlin-Heidelberg, 1981) pp. 243-257.
	Morain, 1989	Morain,F., Distributed primality proving and the primality of (2~39 + 1)/3. INRIA Research Report 1152, Dec. 1989.
	Pomerance et al., 1980	Pomerance,C., Selfridge,J.L. ~~ Wagstaff, S.S.,Jr, The pseudoprimes up to 25.109. Math. Comp. 35 (1980) pp. 1003-1026.
	Rabin, 1980	Rabin,M.O., Probabilistic Algorithm for Testing Primality. J. Number Theory 12 (1980) pp. 128-138.