Related papers: Finding ECM-friendly curves through a study of Gal…

Let E be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Omega of the order. If the prime p splits completely in Omega, then…

Edwards curves are a particular form of elliptic curves that admit a fast, unified and complete addition law. Relations between Edwards curves and Montgomery curves have already been described. Our work takes the view of parameterizing…

For each prime number $\ell$ and for each imaginary quadratic order of class number one or two, we determine all the possible $\ell$-adic Galois representations that occur for any elliptic curve with complex multiplication by such an order…

The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more…

We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes,…

The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower. We use special hyperelliptic curves and Kummer surfaces to…

This article deals with the Galois representation attached to elliptic curves with an isogeny of prime degree over a number field. We first determine uniform criteria for the irreducibility of Galois representations attached to elliptic…

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

In this paper, we present several methods for construction of elliptic curves with large torsion group and positive rank over number fields of small degree. We also discuss potential applications of such curves in the elliptic curve…

Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…

Three decades ago, Montgomery introduced a new elliptic curve model for use in Lenstra's ECM factorization algorithm. Since then, his curves and the algorithms associated with them have become foundational in the implementation of elliptic…

Let $\mathcal{E}$ be a CM elliptic curve defined over a number field $K$, with Weiestrass form $y^3=x^3+bx$ or $y^2=x^3+c$. For every positive integer $m$, we denote by ${\mathcal{E}}[m]$ the $m$-torsion subgroup of ${\mathcal{E}}$ and by…

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…

In this article we perform an extensive study of the spaces of automorphic forms for GL(2) of weight two and level N, for N an ideal in the ring of integers of the quartic CM field generated by the twelfth roots of unity. This study is…

Let K be a number field, and let E be an elliptic curve over K. A famous result by Faltings of 1983 can be reformulated for elliptic curves as follows: if S is a set of primes of good reduction for E having density one, then the K-isogeny…

The modular degree m_E of an elliptic curve E/Q is the minimal degree of any surjective morphism X_0(N) -> E, where N is the conductor of E. We give a necessarily set of criteria for m_E to be odd. Specializing to N prime our results imply…

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…

We study an effective open image theorem for families of elliptic curves and products of elliptic curves ordered by conductor. Unconditionally, we prove that for $100\%$ of pairs of elliptic curves, the largest prime $\ell$, for which the…

Consider a non-CM elliptic curve $E$ defined over $\mathbb{Q}$. For each prime $\ell$, there is a representation $\rho_{E,\ell}: G \to GL_2(\mathbb{F}_\ell)$ that describes the Galois action on the $\ell$-torsion points of $E$, where $G$ is…

In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…