Elliptic curve primality (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Elliptic curve primality" in English language version.

refsWebsite

Global rank English rank

3doi.org

2^nd place

2web.archive.org

1^st place

1rug.nl

2,779^th place

1,997^th place

1jstor.org

26^th place

20^th place

1epfl.ch

4,521^st place

4,877^th place

1t5k.org

low place

1ams.org

451^st place

277^th place

1queensu.ca

6,111^th place

3,868^th place

1leidenuniv.nl

4,798^th place

4,535^th place

1inria.fr

4,903^rd place

3,679^th place

1archives-ouvertes.fr

1,031^st place

879^th place

1semanticscholar.org

11^th place

8^th place

1uni-bonn.de

6,912^th place

8,465^th place

1utm.edu

1,379^th place

1,175^th place

1arxiv.org

69^th place

59^th place

ams.org

Samuel S. Wagstaff Jr. (2013). The Joy of Factoring. Providence, RI: American Mathematical Society. pp. 187–188. ISBN 978-1-4704-1048-3.

archives-ouvertes.fr

hal.archives-ouvertes.fr

Morain, F. (1988). "Implementation of the Atkin-Goldwasser-Kilian primality testing algorithm" (PDF). S2CID 118191463.

arxiv.org

Tsumura, Yu (2009). "Primality tests for $2^{k}n-1$ using elliptic curves". arXiv:0912.5279v1 [math.NT].

doi.org

Atkin, A. O. L.; Morain, F. (1993). "Elliptic Curves and Primality Proving". Mathematics of Computation. 61 (203): 29–68. doi:10.2307/2152935. JSTOR 2152935.
Lenstra, A.K.; Lenstra, H.W. (1990). "Algorithms in Number Theory". Algorithms and Complexity (PDF). pp. 673–715. doi:10.1016/B978-0-444-88071-0.50017-5. ISBN 9780444880710.
Blake, I.; Seroussi, G.; Smart, N. (1999). Elliptic Curves in Cryptography. doi:10.1017/CBO9781107360211. ISBN 9780521653749.

epfl.ch

infoscience.epfl.ch

Lenstra, A.K.; Lenstra, H.W. (1990). "Algorithms in Number Theory". Algorithms and Complexity (PDF). pp. 673–715. doi:10.1016/B978-0-444-88071-0.50017-5. ISBN 9780444880710.

inria.fr

algo.inria.fr

ECPP Comes Back algo.inria.fr

jstor.org

Atkin, A. O. L.; Morain, F. (1993). "Elliptic Curves and Primality Proving". Mathematics of Computation. 61 (203): 29–68. doi:10.2307/2152935. JSTOR 2152935.

leidenuniv.nl

openaccess.leidenuniv.nl

Lenstra, Hendrik W., Efficient Algorithms in Number Theory, https://openaccess.leidenuniv.nl/bitstream/1887/2141/1/346_081.pdf

queensu.ca

mast.queensu.ca

"Queen's University Canada" (PDF). Archived from the original (PDF) on 2016-03-04. Retrieved 2010-01-22.

rug.nl

math.rug.nl

Top, Jaap, Elliptic Curve Primality Proving, http://www.math.rug.nl/~top/atkin.pdf

semanticscholar.org

api.semanticscholar.org

Morain, F. (1988). "Implementation of the Atkin-Goldwasser-Kilian primality testing algorithm" (PDF). S2CID 118191463.

t5k.org

Caldwell, Chris. The Top Twenty: Elliptic Curve Primality Proof from the Prime Pages.

uni-bonn.de

iai.uni-bonn.de

Goldwasser, Shafi, Kilian, Joe, Almost All Primes Can Be Quickly Certified, http://www.iai.uni-bonn.de/~adrian/ecpp/p316-goldwasser.pdf Archived 2011-07-18 at the Wayback Machine

utm.edu

primes.utm.edu

"The Largest Known prime by Year: A Brief History".

web.archive.org

"Queen's University Canada" (PDF). Archived from the original (PDF) on 2016-03-04. Retrieved 2010-01-22.
Goldwasser, Shafi, Kilian, Joe, Almost All Primes Can Be Quickly Certified, http://www.iai.uni-bonn.de/~adrian/ecpp/p316-goldwasser.pdf Archived 2011-07-18 at the Wayback Machine