Elliptic curves and primality proving-Reference-Cited by-同舟云学术

Elliptic curves and primality proving

Published:1993 Issue:203 Volume:61 Page:29-68
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Atkin A. O. L.,Morain F.

Abstract

The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. Problema, numeros primos a compositis dignoscendi, hosque in factores suos primos resolvendi, ad gravissima ac utilissima totius arithmeticae pertinere, et geometrarum tum veterum tum recentiorum industriam ac sagacitatem occupavisse, tam notum est, ut de hac re copiose loqui superfluum foret.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1993-61-203/S0025-5718-1993-1199989-X/S0025-5718-1993-1199989-X.pdf

Reference97 articles.

1. On taking roots in finite fields;Adleman, Leonard,1977

2. L. M. Adleman and M. A. Huang, Recognizing primes in random polynomial time, Proc. 19th STOC (New York City, May 25-27, 1986), ACM Press, New York, 1987, pp. 462-469.

3. On distinguishing prime numbers from composite numbers;Adleman, Leonard M.;Ann. of Math. (2),1983

4. A. O. L. Atkin, Manuscript, Lecture notes of a conference, Boulder, Colorado, August 1986.

5. \bysame, The number of points on an elliptic curve modulo a prime, Preprint, 1991.

Cited by 121 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. CM values of special functions;SCIENTIA SINICA Mathematica;2024-01-01

2. ON DISCRIMINANTS OF MINIMAL POLYNOMIALS OF THE RAMANUJAN CLASS INVARIANTS;Bulletin of the Australian Mathematical Society;2023-04-11

3. Certifying Giant Nonprimes;Lecture Notes in Computer Science;2023

4. Modular curves over number fields and ECM;Research in Number Theory;2022-10-25

5. Computational Number Theory, Past, Present, and Future;Lecture Notes in Mathematics;2022-08-03