相关论文: Constructing pairing-friendly elliptic curves with…

Miyaji, Nakabayashi, and Takano proposed the algorithm for the construction of prime order pairing-friendly elliptic curves with embedding degrees $k=3,4,6$. We present a method for generating generalized MNT curves. The order of such…

Pairing-based cryptographic schemes require so-called pairing-friendly elliptic curves, which have special properties. The set of pairing-friendly elliptic curves that are generated by given polynomials form a complete family. Although a…

The problem of constructing elliptic curves suitable for pairing applications has received a lot of attention. To solve this, we propose a variant algorithm of a known method by Brezing and Weng. We produce new families of parameters using…

In their seminar paper, Miyaji, Nakabayashi and Takano introduced the first method to construct families of prime-order elliptic curves with small embedding degrees, namely k = 3, 4, and 6. These curves, so-called MNT curves, were then…

Let $k=2^mp^n$ for an odd prime $p$ and integers $m\ge 0$ and $n\ge 0$. We obtain lower bounds for the $\rho$-values of cyclotomic families of pairing-friendly elliptic curves with embedding degree $k$ and $r(x)=\Phi_k(x)$. Our bounds imply…

We establish asymptotic lower bounds for the number of elliptic curves over $\mathbb{Q}$ with prescribed entanglement of division fields, ordered by naive height. Such elliptic curves are obtained as $1$-parameter families arising from…

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

This paper is a follow up of arXiv:1702.02255 [math.NT]. We construct explicitly versal families of elliptic curves with rational points of order 4, 6, 8, 10, 12 respectively.

For a given elliptic curve $E_0$ defined over a number field $k$, we construct two families of elliptic curves whose mod 3 representations are isomorphic to that of $E_0$. The isomorphisms in the first family are symplectic, and those in…

We present a heuristic asymptotic formula as $x\to \infty$ for the number of isogeny classes of pairing-friendly elliptic curves with fixed embedding degree $k\geq 3$, with fixed discriminant, with rho-value bounded by a fixed $\rho_0$ such…

Let $p$ be a prime and $K$ a number field of degree $p$. We count the number of elliptic curves, up to $\bar{K}$-isomorphism, having a prescribed property, where this property is either that the curve contains a fixed torsion group as a…

A cycle of elliptic curves is a list of elliptic curves over finite fields such that the number of points on one curve is equal to the size of the field of definition of the next, in a cyclic way. We study cycles of elliptic curves in which…

While there has been considerable interest in the problem of finding elliptic curves of high rank over $\mathbb{Q}$, very few parametrized families of elliptic curves of generic rank $\geq 8$ have been published. In this paper we use…

Much attention has been given to the efficient computation of pairings on elliptic curves with even embedding degree since the advent of pairing-based cryptography. The few existing works in the case of odd embedding degrees require some…

We compute equations for the families of elliptic curves 9-congruent to a given elliptic curve. We use these to find infinitely many non-trivial pairs of 9-congruent elliptic curves over Q, i.e. pairs of non-isogenous elliptic curves over Q…

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…

Let E_k denote the elliptic curve defined by y^2 = x(x^2 - k^2). We consider the curves with k = pl, p = l = 1 mod 8 primes, and show that the density of rank-0 curves among them is at least 1/2 by explicitly constructing nontrivial…

A rational Diophantine triple is a set of three nonzero rational a,b,c with the property that ab+1, ac+1, bc+1 are perfect squares. We say that the elliptic curve y^2 = (ax+1)(bx+1)(cx+1) is induced by the triple {a,b,c}. In this paper, we…

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…

We present an algorithm that, on input of a positive integer N together with its prime factorization, constructs a finite field F and an elliptic curve E over F for which E(F) has order N. Although it is unproved that this can be done for…