Some remarks on primality proving and elliptic curves (Q2513761)

This paper is a survey of a method to deduce efficient deterministic primality tests using elliptic curves with complex multiplication (CM). Section 2 summarizes the historical development of the topic of primality tests and, in particular, of the first tests based in elliptic curves, as the pioneer test of Goldwasser-Kilian. Section 4 present a primality test for the numbers of Mersenne \(M_k= 2^{2^k}\),\, test due to \textit{B. H. Gross} [J. Number Theory 110, No. 1, 114--119 (2005; Zbl 1074.11065)] which uses an elliptic curve defined over \(\mathbb{Q}\),\, with \(j\)-invariant \(0\) and endomorphism ring \(Z[i]\), showing its formal similarity with the classical Pepin's primality test for the numbers of Fermat \(F_k=2^k-1\). Section 5 shows results of \textit{R. Denomme} and \textit{G. Savin} [J. Number Theory 128, No. 8, 2398--2412 (2008; Zbl 1196.11168)] which provide similar tests of primality for the numbers of Fermat and other particular families of numbers, tests based on elliptic curves defined over \(\mathbb{Q}\) and with CM by \(\mathbb{Q}(\sqrt{-1})\)\, and \(\mathbb{Q}(\sqrt{-3})\). Then Sections 6 and 7 show the limitations of the methods of Gross and Denomme-Savin and they synthesize a general framework due to the author of the present paper et al. [Math. Comput. 85, No. 299, 1461--1483 (2016; Zbl 1345.11088)]. That framework is based on CM elliptic curves defined over numbers fields. Sections 8 gives and example (from the paper of Silverberg et al.) which uses an elliptic curve not defined over \(\mathbb{Q}\).