scholarly journals Computing the endomorphism ring of an ordinary elliptic curve over a finite field

2011 ◽  
Vol 131 (5) ◽  
pp. 815-831 ◽  
Author(s):  
Gaetan Bisson ◽  
Andrew V. Sutherland
Keyword(s):  
Finite Field ◽  
Elliptic Curve ◽  
Endomorphism Ring

scholarly journals Classification of Elliptic Cubic Curves Over The Finite Field of Order Nineteen

2016 ◽  
Vol 13 (4) ◽  
pp. 846-852
Author(s):  
Baghdad Science Journal
Keyword(s):  
Finite Field ◽  
Elliptic Curve ◽  
Maximum Size ◽  
Cubic Curves ◽  
Projective Equivalence

Plane cubics curves may be classified up to isomorphism or projective equivalence. In this paper, the inequivalent elliptic cubic curves which are non-singular plane cubic curves have been classified projectively over the finite field of order nineteen, and determined if they are complete or incomplete as arcs of degree three. Also, the maximum size of a complete elliptic curve that can be constructed from each incomplete elliptic curve are given.

Generalized Artin'S Conjecture for Primitive Roots and Cyclicity Mod of Elliptic Curves Over Function Fields

1995 ◽  
Vol 38 (2) ◽  
pp. 167-173 ◽  
Author(s):  
David A. Clark ◽  
Masato Kuwata
Keyword(s):  
Finite Field ◽  
Prime Ideal ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Function Field ◽  
Function Fields ◽  
Artin's Conjecture ◽  
Primitive Roots

AbstractLet k = Fq be a finite field of characteristic p with q elements and let K be a function field of one variable over k. Consider an elliptic curve E defined over K. We determine how often the reduction of this elliptic curve to a prime ideal is cyclic. This is done by generalizing a result of Bilharz to a more general form of Artin's primitive roots problem formulated by R. Murty.

scholarly journals No Singular Modulus Is a Unit

2018 ◽  
Vol 2020 (24) ◽  
pp. 10005-10041 ◽  
Author(s):  
Yuri Bilu ◽  
Philipp Habegger ◽  
Lars Kühne
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Endomorphism Ring ◽  
Complex Multiplication ◽  
Computer Assisted ◽  
Algebraic Unit ◽  
Special Points ◽  
Effective Proof ◽  
Rule Out

Abstract A result of the 2nd-named author states that there are only finitely many complex multiplication (CM)-elliptic curves over $\mathbb{C}$ whose $j$-invariant is an algebraic unit. His proof depends on Duke’s equidistribution theorem and is hence noneffective. In this article, we give a completely effective proof of this result. To be precise, we show that every singular modulus that is an algebraic unit is associated with a CM-elliptic curve whose endomorphism ring has discriminant less than $10^{15}$. Through further refinements and computer-assisted arguments, we eventually rule out all remaining cases, showing that no singular modulus is an algebraic unit. This allows us to exhibit classes of subvarieties in ${\mathbb{C}}^n$ not containing any special points.

scholarly journals Determining the $2$-Sylow subgroup of an elliptic curve over a finite field

2004 ◽  
Vol 74 (249) ◽  
pp. 411-428 ◽  
Author(s):  
J. Miret ◽  
R. Moreno ◽  
A. Rio ◽  
M. Valls
Keyword(s):  
Finite Field ◽  
Elliptic Curve ◽  
Sylow Subgroup

scholarly journals Constructing supersingular elliptic curves with a given endomorphism ring

2014 ◽  
Vol 17 (A) ◽  
pp. 71-91 ◽  
Author(s):  
Ilya Chevyrev ◽  
Steven D. Galbraith
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Endomorphism Ring ◽  
Quaternion Algebra ◽  
Maximal Order ◽  
Running Time ◽  
Successive Minima ◽  
Supersingular Elliptic Curves ◽  
Class Polynomials ◽  
Theoretical Results

AbstractLet $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}\mathcal{O}$ be a maximal order in the quaternion algebra $B_p$ over $\mathbb{Q}$ ramified at $p$ and $\infty $. The paper is about the computational problem: construct a supersingular elliptic curve $E$ over $\mathbb{F}_p$ such that ${\rm End}(E) \cong \mathcal{O}$. We present an algorithm that solves this problem by taking gcds of the reductions modulo $p$ of Hilbert class polynomials.New theoretical results are required to determine the complexity of our algorithm. Our main result is that, under certain conditions on a rank three sublattice $\mathcal{O}^T$ of $\mathcal{O}$, the order $\mathcal{O}$ is effectively characterized by the three successive minima and two other short vectors of $\mathcal{O}^T\! .$ The desired conditions turn out to hold whenever the $j$-invariant $j(E)$, of the elliptic curve with ${\rm End}(E) \cong \mathcal{O}$, lies in $\mathbb{F}_p$. We can then prove that our algorithm terminates with running time $O(p^{1+\varepsilon })$ under the aforementioned conditions.As a further application we present an algorithm to simultaneously match all maximal order types with their associated $j$-invariants. Our algorithm has running time $O(p^{2.5 + \varepsilon })$ operations and is more efficient than Cerviño’s algorithm for the same problem.

scholarly journals Finding roots in with the successive resultants algorithm

2014 ◽  
Vol 17 (A) ◽  
pp. 203-217 ◽  
Author(s):  
Christophe Petit
Keyword(s):  
Finite Field ◽  
Elliptic Curve ◽  
Finite Fields ◽  
Coding Theory ◽  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Polynomial Equations ◽  
Preliminary Results ◽  
Characteristic Case ◽  
Practical Security

AbstractThe problem of solving polynomial equations over finite fields has many applications in cryptography and coding theory. In this paper, we consider polynomial equations over a ‘large’ finite field with a ‘small’ characteristic. We introduce a new algorithm for solving this type of equations, called the successive resultants algorithm (SRA). SRA is radically different from previous algorithms for this problem, yet it is conceptually simple. A straightforward implementation using Magma was able to beat the built-in Roots function for some parameters. These preliminary results encourage a more detailed study of SRA and its applications. Moreover, we point out that an extension of SRA to the multivariate case would have an important impact on the practical security of the elliptic curve discrete logarithm problem in the small characteristic case.Supplementary materials are available with this article.

Sign in / Sign up

Export Citation Format

Share Document