A strategy for elliptic curve primality proving

[1] A. O. L. Atkin, F. Morain, Elliptic curves and primality proving, Math. Comp.61, 203 (1993) 29–68. ⇒125, 128, 12910.1090/S0025-5718-1993-1199989-XSearch in Google Scholar

[2] W. Bosma, J. Cannon, C. Playoust, The Magma algebra system I: the user language, J. Symbolic Comput., 24, 3 (1997) 235–265. ⇒12610.1006/jsco.1996.0125Search in Google Scholar

[3] W. Bosma, E. Cator, A. Járai, Gy. Kiss, Primality proofs with elliptic curves: heuristics and analysis, Ann. Univ. Sci. Budapest. Sect. Comput., in print ⇒ 126, 127, 129, 130, 131, 132Search in Google Scholar

[4] G. Farkas, G. Kallós, Gy. Kiss, Large primes in generalized pascal triangles, Acta Univ. Sapientiae, Informatica3, 2 (2011) 158–171. ⇒126Search in Google Scholar

[5] A. Járai, Gy. Kiss, Finding suitable paths for the elliptic curve primality proving algorithm, Acta Univ. Sapientiae, Informatica5, 1 (2013) 35–52. ⇒12610.2478/ausi-2014-0003Search in Google Scholar

[6] A.K.Lenstra, H.W. Lenstra, Jr., Algorithms in number theory, in: Handbook of Theoretical Computer Science, Vol. A. Algorithms and Complexity (ed. J. van Leeuwen), Elsevier, 1990, pp. 673–716. ⇒125, 12710.1016/B978-0-444-88071-0.50017-5Search in Google Scholar

[7] F. Morain, Implementing the asymptotically fast version of the elliptic curve primality proving algorithm, Math. Comp.76, 257 (2007) 493–505. ⇒125, 12610.1090/S0025-5718-06-01890-4Search in Google Scholar