Related papers: Constructing elliptic curves of prime order

Let $E$ be the elliptic curve $y^2=x(x+1)(x+t)$ over the field $\Fp(t)$ where $p$ is an odd prime. We study the arithmetic of $E$ over extensions $\Fq(t^{1/d})$ where $q$ is a power of $p$ and $d$ is an integer prime to $p$. The rank of $E$…

We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…

In this paper, we present efficient algorithms for computing the number of points and the order of the Jacobian group of a superelliptic curve over finite fields of prime order p. Our method employs the Hasse-Weil bounds in conjunction with…

We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…

We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field F_q. Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and, for a prime $p$ of good reduction for $E$ let $\tilde{E}_p$ denote the reduction of $E$ modulo $p$. Inspired by an elliptic curve analogue of Artin's primitive root conjecture…

We construct new families of elliptic curves over \(\FF_{p^2}\) with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant-Lambert-Vanstone (GLV) and…

We generalize Elkies's method, an essential ingredient in the SEA algorithm to count points on elliptic curves over finite fields of large characteristic, to the setting of p.p. abelian surfaces. Under reasonable assumptions related to the…

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$,…

Let $E$ be an elliptic curve defined over $\mathbb Q$ and $\widetilde{E}_p$ denote the reduction of $E$ modulo a prime $p$ of good reduction for $E$. The divisibility of $|\widetilde{E}_{p}(\mathbb{F}_p)|$ by an integer $m\ge 2$ for a set…

The "defect" of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre bound for the curve. We present a construction for producing genus-4 double covers of genus-2 curves over…

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…

In this article we present a characterization of elliptic curves defined over a finite field Fq which possess a rational subgroup of order three. There are two posible cases depending on the rationality of the points in these groups. We…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…

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 present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.

We use the solution set of a real ordinary differential equation which has order n which is at least 2 to construct a smooth curve C in R^n. We describe when C is a proper embedding of infinite length with finite total first curvature.

The aim of this paper is to justify the common cryptographic practice of selecting elliptic curves using their order as the primary criterion. We can formalize this issue by asking whether the discrete log problem (DLOG) has the same…

In this paper, we propose the use of Ramanujan class of polynomials for the construction of prime order elliptic curves using the CM-method. We compare (theoretically and experimentally) the efficiency of using this new class against the…