Elliptic periods and primality proving

Primality tests for 2^kn-1 using elliptic curves

We propose some primality tests for 2^kn-1, where k, n in Z, k>= 2 and n odd. There are several tests depending on how big n is. These tests are proved using properties of elliptic curves. Essentially, the new primality tests are the elliptic curve version of the Lucas-Lehmer-Riesel primality test. Note:An anonymous referee suggested that Benedict H. Gross already proved the same result about a primality test for Mersenne primes using elliptic curve.

Dual Elliptic Primes and Applications to Cyclotomy Primality Proving

Two rational primes p, q are called dual elliptic if there is an elliptic curve E mod p with q points. They were introduced as an interesting means for combining the strengths of the elliptic curve and cyclotomy primality proving algorithms. By extending to elliptic curves some notions of galois theory of rings used in the cyclotomy primality tests, one obtains a new algorithm which has heuristic cubic run time and generates certificates that can be verified in quadratic time. After the break through of Agrawal, Kayal and Saxena has settled the complexity theoretical problem of primality testi…

利用类数为三的虚二次域具有复乘的椭圆曲线进行素性证明

Primality proving using elliptic curves with complex multiplication by imaginary quadratic fields of class number three

本文将Abatzoglou等人的复乘椭圆曲线素性证明框架推广到类数为三的虚二次域，利用2分裂的类数三虚二次域得到更高效的素性证明算法，并给出基于Q(√-23)和Q(√-31)的两个特殊整数序列及计算结果。

Extending Lenstra's Primality Test to CM elliptic curves and a new quasi-quadratic Las Vegas algorithm for primality

For an elliptic curve with CM by $K$ defined over its Hilbert class field, $E/H$, we extend Lenstra's finite fields test to generators of norms of certain ideals in $\mathcal{O}_H$, yielding a sufficient $\widetilde{O}(\log^3 N)$ primality test and partially answering an open question of Lemmermeyer in the case of CM elliptic curves. Letting $ι,γ, b\in \mathcal{O}_K$, $(ι)$ prime, and $b$ a primitive $k$-th root of unity modulo $(ι)^n$ we specialize this test to rational integers of the form $N_{K/\mathbb{Q}}(γι^n+b)$ with the norm of $γ$ small, giving a Las Vegas test for primality with avera…

Kummer surfaces for primality testing

We use the arithmetic of the Kummer surface associated to the Jacobian of a hyperelliptic curve to study the primality of integers of the form $4m^2 5^n-1$. We provide an algorithm capable of proving the primality or compositeness of most of the integers in these families and discuss in detail the necessary steps to implement this algorithm in a computer. Although an indetermination is possible, in which case another choice of initial parameters should be used, we prove that the probability of reaching this situation is exceedingly low and decreases exponentially with $n$.

Primality tests for Fermat numbers and 2^(2k+1)\pm2^(k+1)+1

Robert Denomme and Gordan Savin made a primality test for Fermat numbers 2^(2^k)+1 using elliptic curves. We propose another primality test using elliptic curves for Fermat numbers and also give primality tests for integers of the form 2^(2k+1)\pm2^(k+1)+1.

Deterministic elliptic curve primality proving for a special sequence of numbers

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm uses O(log N) arithmetic operations in the ring Z/NZ, implying a bit complexity that is quasi-quadratic in log N. Notably, neither of the classical "N-1" or "N+1" primality tests apply to the integers in our sequence. We discuss how this algorithm may be applied, in combination with sieving techniques, to efficiently search for very large primes. This has a…

The uniform primality conjecture for elliptic curves

An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over the rational function field, unconditionally. In the latter case, a uniform bound is obtained on the index of a prime term. Sharpened versions of these techniques are shown to lead to explicit results where all the irreducible terms can be computed.

Universal elliptic Gauß sums and applications

We present new ideas for computing elliptic Gauß sums, which constitute an analogue of the classical cyclotomic Gauß sums and whose use has been proposed in the context of counting points on elliptic curves and primality tests. By means of certain well-known modular functions we define the universal elliptic Gauß sums and prove they admit an efficiently computable representation in terms of the $j$-invariant and another modular function. After that, we show how this representation can be used for obtaining the elliptic Gauß sum associated to an elliptic curve over a finite field $\mathbb{F}_p$…

$Kp^n+1$数的质数测试及安全质数和索菲·热尔曼质数的推广

A primality test for $Kp^n+1$ numbers and a generalization of Safe Primes and Sophie Germain Primes

本文对形式为$Kp^n+1$的整数推广了普罗特定理，提出了一种仅需一次模幂运算的质数测试方法，无需计算任何GCD。同时提供了两种测试以提高验证$Kp^n+1$数质数的可能性。作为这些测试的推论，我们给出了三个整数家族$N$，其质数性只能通过证明$a^{N-1} \equiv 1 \pmod N$（费马测试）来确认。还推广了安全质数，定义为$a$-安全质数，因其$N-1$具有与安全质数相同的大型质因数。我们讨论了这些数的分布问题，并提出了关于相关数$a$-索菲·热尔曼质数分布的猜想。

On the Probability of Relative Primality in the Gaussian Integers

This paper studies the interplay between probability, number theory, and geometry in the context of relatively prime integers in the ring of integers of a number field. In particular, probabilistic ideas are coupled together with integer lattices and the theory of zeta functions over number fields in order to show that $$P(\gcd(z_{1},z_{2})=1) = \frac{1}{ζ_{\Q(i)}(2)}$$ where $z_{1},z_{2} \in \mathbb{Z}[i]$ are randomly chosen and $ζ_{\Q(i)}(s)$ is the Dedekind zeta function over the Gaussian integers. Our proof outlines a lattice-theoretic approach to proving the generalization of this theore…

Constructing elliptic curves with a known number of points over a prime field

Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication to construct such curves. One of the steps in this method is the calculation of a root modulo n of the Hilbert class polynomial H(X) for a fundamental discriminant D. The usual way is to compute H(X) over the integers and then to find the root modulo n. We present a modified version of the Chinese remainder theorem (CRT) to compute H(X) modulo n directly fr…

Proving the Birch and Swinnerton-Dyer conjecture for specific elliptic curves of analytic rank zero and one

We describe an algorithm to prove the Birch and Swinnerton-Dyer conjectural formula for any given elliptic curve defined over the rational numbers of analytic rank zero or one. With computer assistance we have proved the formula for 16714 of the 16725 such curves of conductor less than 5000.

Proving modularity for a given elliptic curve over an imaginary quadratic field

We present an algorithm to determine if the $L$-series associated to an automorphic representation and the one associated to an elliptic curve over an imaginary quadratic field agree. By the work of Harris-Soudry-Taylor, Taylor and Berger-Harcos (cf. \cite{harris-taylor}, \cite{taylorII} and \cite{berger-harcos}) we can associate to an automorphic representation a family of compatible $p$-adic representations. Our algorithm is based on Faltings-Serre's method to prove that $p$-adic Galois representations are isomorphic.

素数幂域上椭圆曲线的殆素数阶

Almost Prime Orders of Elliptic Curves Over Prime Power Fields

本文研究素数 p 使得 |E(F_{p^l})| / |E(F_p)| 具有有界素因子的无穷性，对 CM 曲线无条件应用大筛法，对非 CM 曲线在 GRH 下应用 Chebotarev 密度定理，并利用向量筛法给出相关殆素数个数的下界。

Iwasawa theory for elliptic curves

We study this subject by first proving that the p-primary subgroup of the classical Selmer group for an elliptic curve with good, ordinary reduction at a prime p has a very simple and elegant description which involves just the Galois module of p-power torsion points. We then prove theorems of Mazur, Schneider, and Perrin-Riou on the basis of this description. The final section, which is half of this long paper, contains a number of results and examples including a thorough study of the mu-invariant.

A method for proving the completeness of a list of zeros of certain L-functions

When it comes to partial numerical verification of the Riemann Hypothesis, one crucial part is to verify the completeness of a list of pre-computed zeros. Turing developed such a method, based on an explicit version of a theorem of Littlewood on the average of the argument of the Riemann zeta function. In a previous paper we suggested an alternative method based on the Weil-Barner explicit formula. This method asymptotically sacrifices fewer zeros in order to prove the completeness of a list of zeros with imaginary part in a given interval. In this paper, we prove a general version of this met…

算术级数中椭圆曲线模 $p$ 的循环性与指数

Cyclicity and exponent of elliptic curves modulo $p$ in arithmetic progressions

本文研究算术级数中素数上椭圆曲线约化群的循环性与平均指数，证明 CM 情形的无条件渐近式并改进相关条件估计。