اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn The Rank Of Congruent Elliptic Curves
82
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
The paper proves that the Birch and Swinnerton-Dyer conjecture is false.
We generalize a construction of families of moderate rank elliptic curves over $mathbb{Q}$ to number fields $K/mathbb{Q}$. The construction, originally due to Steven J. Miller, Alvaro Lozano-Robledo and Scott Arms, invokes a theorem of Rosen and Silv
erman to show that computing the rank of these curves can be done by controlling the average of the traces of Frobenius, the construction for number fields proceeds in essentially the same way. One novelty of this method is that we can construct families of moderate rank without having to explicitly determine points and calculating determinants of height matrices.
We present rank-record breaking elliptic curves having torsion subgroups Z/2Z, Z/3Z, Z/4Z, Z/6Z, and Z/7Z.
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.
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
ve 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
