scholarly journals Serre’s uniformity conjecture for elliptic curves with rational cyclic isogenies

2018 ◽  
Vol 371 (1) ◽  
pp. 137-146 ◽  
Author(s):  
Pedro Lemos
Keyword(s):  
Elliptic Curves ◽  
Serre’S Uniformity

Isogenies of non-CM elliptic curves with rational j-invariants over number fields

2017 ◽  
Vol 164 (1) ◽  
pp. 179-184 ◽  
Author(s):  
FILIP NAJMAN
Keyword(s):  
Elliptic Curves ◽  
Upper Bound ◽  
Complex Multiplication ◽  
Number Fields ◽  
Positive Integers ◽  
Serre’S Uniformity

AbstractWe unconditionally determine $I_{\mathbb Q}(d)$, the set of possible prime degrees of cyclic K-isogenies of elliptic curves with ${\mathbb Q}$-rational j-invariants and without complex multiplication over number fields K of degree ≤ d, for d ≤ 7, and give an upper bound for $I_{\mathbb Q}(d)$ for d > 7. Assuming Serre's uniformity conjecture, we determine $I_{\mathbb Q}(d)$ exactly for all positive integers d.

Elliptic Curves

1997 ◽  
Author(s):  
Henry McKean ◽  
Victor Moll
Keyword(s):  
Elliptic Curves

The Joint Universality for L-Functions of Elliptic Curves

2004 ◽  
Vol 9 (4) ◽  
pp. 331-348
Author(s):  
V. Garbaliauskienė
Keyword(s):  
Elliptic Curves ◽  
Rational Numbers ◽  
Joint Universality ◽  
Universality Theorem ◽  
Joint Universality Theorem

A joint universality theorem in the Voronin sense for L-functions of elliptic curves over the field of rational numbers is proved.

PERSPECTIVES OF ELLIPTICAL CRYPTOGRAPHY TO ENSURE THE INTEGRITY AND CONFIDENTIALITY OF INFORMATION

2019 ◽  
Author(s):  
Anna ILYENKO ◽  
Sergii ILYENKO ◽  
Yana MASUR
Keyword(s):  
Information Systems ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Computational Efficiency ◽  
Digital Signature ◽  
Discrete Logarithm ◽  
Algebraic Groups ◽  
Schnorr Signature ◽  
Stability Of Algorithms

In this article, the main problems underlying the current asymmetric crypto algorithms for the formation and verification of electronic-digital signature are considered: problems of factorization of large integers and problems of discrete logarithm. It is noted that for the second problem, it is possible to use algebraic groups of points other than finite fields. The group of points of the elliptical curve, which satisfies all set requirements, looked attractive on this side. Aspects of the application of elliptic curves in cryptography and the possibilities offered by these algebraic groups in terms of computational efficiency and crypto-stability of algorithms were also considered. Information systems using elliptic curves, the keys have a shorter length than the algorithms above the finite fields. Theoretical directions of improvement of procedure of formation and verification of electronic-digital signature with the possibility of ensuring the integrity and confidentiality of information were considered. The proposed method is based on the Schnorr signature algorithm, which allows data to be recovered directly from the signature itself, similarly to RSA-like signature systems, and the amount of recoverable information is variable depending on the information message. As a result, the length of the signature itself, which is equal to the sum of the length of the end field over which the elliptic curve is determined, and the artificial excess redundancy provided to the hidden message was achieved.

Algorithm for directly computing 7P elliptic curves and its application

2013 ◽  
Vol 33 (7) ◽  
pp. 1870-1874
Author(s):  
Zhongxi LAI ◽  
Zhanjun ZHANG ◽  
Dongya TAO
Keyword(s):  
Elliptic Curves
Sign in / Sign up

Export Citation Format

Share Document