Related papers: Constructing elliptic curves in almost polynomial …

We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3),…

We will describe an algorithm to construct an elliptic curve $E_{f_q}$ over some prime field $\mathbb{F}_p$ such that such that $|E_{f_q}(\mathbb{F}_p)| = f_q$, where $f_q$ is a probable Fibonacci prime for some prime index $q$. The…

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…

We present a method for constructing optimized equations for the modular curve X_1(N) using a local search algorithm on a suitably defined graph of birationally equivalent plane curves. We then apply these equations over a finite field F_q…

We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $$n^{1+o(1)} \log^{1+o(1)}q + \max_{\ell}…

Let O be a maximal order in the quaternion algebra B_p over Q ramified at p and infinity. The paper is about the computational problem: Construct a supersingular elliptic curve E over F_p such that End(E) = O. We present an algorithm that…

In the present paper we provide a probabilistic polynomial time algorithm that reduces the complete factorization of any squarefree integer $n$ to counting points on elliptic curves modulo $n$, succeeding with probability $1-\varepsilon$,…

We consider a quantum polynomial-time algorithm which solves the discrete logarithm problem for points on elliptic curves over $GF(2^m)$. We improve over earlier algorithms by constructing an efficient circuit for multiplying elements of…

Let $E$ be an elliptic curve over the finite field $\mathbb F_q$. We prove that, when $n$ is a sufficiently large positive integer, $\#E(\mathbb F_{q^n})$ has a prime factor exceeding $n\exp(c\log n/\log\log n)$.

Let $p$ be a prime and let $\mathbf{E}$ be an elliptic curve defined over the finite field $\mathbb{F}_p$ of $p$ elements. For a point $G\in\mathbf{E}(\mathbb{F}_p)$ the elliptic curve congruential generator (with respect to the first…

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…

Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…

The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the primality of large numbers. Its running time cannot be proven rigorously, but heuristic arguments show that it should…

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…

For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…

Given a prime power q, for every pair of positive integers m and n with m dividing the GCD of n and q-1, we construct a modular curve over F_q that parametrizes elliptic curves over F_q along with F_q-defined points P and Q of order m and…

We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…

We study the problem of efficiently constructing a curve C of genus 2 over a finite field F for which either the curve C itself or its Jacobian has a prescribed number N of F-rational points. In the case of the Jacobian, we show that any…

Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…

We present efficient algorithms for counting points on a smooth plane quartic curve $X$ modulo a prime $p$. We address both the case where $X$ is defined over $\mathbb F_p$ and the case where $X$ is defined over $\mathbb Q$ and $p$ is a…