Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn cycles of pairing-friendly elliptic curves
130
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 every curve is pairing-friendly. These have recently found notable applications in pairing-based cryptography, for instance in improving the scalability of distributed ledger technologies. We construct a new cycle of length 4 consisting of MNT curves, and characterize all the possibilities for cycles consisting of MNT curves. We rule out cycles of length 2 for particular choices of small embedding degrees. We show that long cycles cannot be constructed from families of curves with the same complex multiplication discriminant, and that cycles of composite order elliptic curves cannot exist. We show that there are no cycles consisting of curves from only the Freeman or Barreto--Naehrig families.
rate research
Read More
We discuss a non-computational elementary approach to a well-known criterion of divisibility by 2 in the group of rational points on an elliptic curve.
Let $E$ be an elliptic curve, with identity $O$, and let $C$ be a cyclic subgroup of odd order $N$, over an algebraically closed field $k$ with $operatorname{char} k mid N$. For $P in C$, let $s_P$ be a rational function with divisor $N cdot P - N cdot O$. We ask whether the $N$ functions $s_P$ are linearly independent. For generic $(E,C)$, we prove that the answer is yes. We bound the number of exceptional $(E,C)$ when $N$ is a prime by using the geometry of the universal generalized elliptic curve over $X_1(N)$. The problem can be recast in terms of sections of an arbitrary degree $N$ line bundle on $E$.
We prove new results on splitting Brauer classes by genus 1 curves, settling in particular the case of degree 7 classes over global fields. Though our method is cohomological in nature, and proceeds by considering the more difficult problem of splitting $mu_N$-gerbes, we use crucial input from the arithmetic of modular curves and explicit $N$-descent on elliptic curves.
We prove two theorems concerning isogenies of elliptic curves over function fields. The first one describes the variation of the height of the $j$-invariant in an isogeny class. The second one is an isogeny estimate, providing an explicit bound on the degree of a minimal isogeny between two isogenous elliptic curves. We also give several corollaries of these two results.
This is an introduction to a probabilistic model for the arithmetic of elliptic curves, a model developed in a series of articles of the author with Bhargava, Kane, Lenstra, Park, Rains, Voight, and Wood. We discuss the theoretical evidence for the model, and we make predictions about elliptic curves based on corresponding theorems proved about the model. In particular, the model suggests that all but finitely many elliptic curves over $mathbb{Q}$ have rank $le 21$, which would imply that the rank is uniformly bounded.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
