Easy numbers for the elliptic curve primality proving algorithm

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Easy numbers for the elliptic curve primality proving algorithm

Full text

Pdf (402 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: 263 - 268

Year of Publication: 1992

ISBN:0-89791-489-9

Author

F. Morain

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): 2, Downloads (12 Months): 15, Citation Count: 0

Additional Information:

references index terms 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.143326 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.

	1	L. M. ADLEMAN, C. POMERANCE, AND R. S. RUMELY. On distinguishing prime numbers from composite numbers. Annals of Math. 117 (1983), 173-206.
	2	A. O. L. ATKIN AND F. MORAIN. Elliptic curves and primality proving. Research Report 1256, INRIA, Juin 1990. Submitted to Math. Comp.
	3	A. O. L. ATKIN AND F. MORAIN. Finding suitable curves for the elliptic curve method of factorization. To appear in Mathematics of Computation. Also available as INRIA Research Report no 1547, M arch 1991.
	4	W. BOSMA. Primality testing using elliptic curves. Tech. Rep. 85-12, Math. Instituut, Universiteit van Amsterdam, 1985.
	5	J. BRILLIIART, D. H. LEHMER, AND J. L. SELFRIDGE. New primality criteria and factorizations of 2m\plusmn1. Math. Comp. 29, 130 (1975), 620-647.
	6	J. BRILLHART, D. H. LEHMER, J. L. SELFRIDGE, B. TUCKERMAN, AND S. S. WAGSTAFF, JR. Factorizations of bn 1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers, 2 ed. No. 22 in Contemporary Mathematics. AMS, 1988.
	7	D V Chudnovsky , G V Chudnovsky, Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Advances in Applied Mathematics, v.7 n.4, p.385-434, Dec. 1986 [doi>10.1016/0196-8858(86)90023-0]
	8	H. COHEN AND A. K. LENSTRA. Implementation of a new primality test. Math. Comp. 48, 177 (1987), 103-121.
	9	H. COHEN AND H. W. LENSTRA, JR. Primality testing and Jacobi sums. Math. Comp. 42, 165 (1984), 297-330.
	10	S Goldwasser , J Kilian, Almost all primes can be quickly certified, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.316-329, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12162]
	11	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	12	A. K. LENSTRA, H. W. LENSTRA, JR., M. S. MANASSE, AND J. M. POLLARD. The factorization of the ninth Fermat number. To appear, 1991.
	13	F. MORAIN. Courbes elliptiqu.es et tests de primalitd. PhD thesis, Universit~. Claude Bernard-Lyon I, Septembre 1990.
	14	Frnaçois Morain, Distributed primality proving and the primality of (23539+1)/3, Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology, p.110-123, February 1991, Aarhus, Denmark
	15	F. MORAIN. Elliptic curves, primality proving and some Titanic primes. In Journ~es Arthm~tiques I989 (1992), vol. 198-199-200 of Ast~risque, SMF, pp. 245-251.
	16	F. MORAIN. Prime values of partition numbers and some new large primes, in preparation, Apr. 1992.
	17	J. M. POLLARD. Theorems on factoriza.- tion and prima.lity testing. Proc. Cambr. Philos. Soc. 76 (1974), 521--528.
	18	P. RIBENBOIM. The book of prime number records, 2nd ed. Springer, 1989.
	19	M. C. WUNDERLICH. A performance analysis of a simple prime-testing algorithm. Math. Comp. 40, 162 (1983), 709- 714.