Potential Good Reduction of Elliptic Curves
نویسندگان
چکیده
منابع مشابه
Formal Groups of Elliptic Curves with Potential Good Supersingular Reduction
Let L be a number field and let E/L be an elliptic curve with potential supersingular reduction at a prime ideal ℘ of L above a rational prime p. In this article we describe a formula for the slopes of the Newton polygon associated to the multiplication-by-p map in the formal group of E, that only depends on the congruence class of p mod 12, the ℘-adic valuation of the discriminant of a model f...
متن کاملUniform Boundedness and Elliptic Curves with Potential Supersingular Reduction
Let d ≥ 1 be fixed. Let F be a number field of degree d, and let E/F be an elliptic curve. Let E(F )tors be the torsion subgroup of E(F ). In 1996, Merel proved the uniform boundedness conjecture, i.e., there is a constant B(d), which depends on d but not on the chosen field F or on the curve E/F , such that the size of E(F )tors is bounded by B(d). Moreover, Merel gave a bound (exponential in ...
متن کاملFinding All Elliptic Curves with Good Reduction Outside a Given Set of Primes
We describe an algorithm for determining elliptic curves defined over a given number field with a given set of primes of bad reduction. Examples are given over Q and over various quadratic fields.
متن کاملSe p 20 04 An analog to Deuring ’ s criterion for good reduction of elliptic curves ∗
In this paper we study the reduction of p-cyclic covers of the p-adic line ramified at exactly four points. For p = 2 these covers are elliptic curves and Deuring has given a criterion for when such a curve has good reduction. Here we consider the case of p > 2 and completely determine the stable model of the cover. In particular we obtain a finite extension R of R necessary for the stable redu...
متن کاملIsogeny cordillera algorithm to obtain cryptographically good elliptic curves
The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computationally unfeasible when elliptic curves are suitably chosen. This paper provides an algorithm to obtain cryptographically good elliptic curves from a given one. The core of such a procedure lies on the usage of successi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2002
ISSN: 0747-7171
DOI: 10.1006/jsco.2002.0555