ﻻ يوجد ملخص باللغة العربية
We give an elementary and self-contained introduction to pairings on elliptic curves over finite fields. For the first time in the literature, the three different definitions of the Weil pairing are stated correctly and proved to be equivalent using Weil reciprocity. Pairings with shorter loops, such as the ate, ate$_i$, R-ate and optimal pairings, together with their twisted variants, are presented with proofs of their bilinearity and non-degeneracy. Finally, we review different types of pairings in a cryptographic context. This article can be seen as an update chapter to A. Enge, Elliptic Curves and Their Applications to Cryptography - An Introduction, Kluwer Academic Publishers 1999.
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.
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 cur
In this paper, $p$ and $q$ are two different odd primes. First, We construct the congruent elliptic curves corresponding to $p$, $2p$, $pq$, and $2pq,$ then, in the cases of congruent numbers, we determine the rank of the corresponding congruent elliptic curves.
Let $L/K$ be a quadratic extension of global fields. We study Cohen-Lenstra heuristics for the $ell$-part of the relative class group $G_{L/K} := textrm{Cl}(L/K)$ when $K$ contains $ell^n$th roots of unity. While the moments of a conjectural distribu
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 c