Sciweavers

ANTS
2008
Springer
103views Algorithms» more  ANTS 2008»
15 years 9 months ago
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We g...
Koray Karabina, Edlyn Teske
ANTS
2008
Springer
83views Algorithms» more  ANTS 2008»
15 years 9 months ago
Enumeration of Totally Real Number Fields of Bounded Root Discriminant
We enumerate all totally real number fields F with root discriminant F 14. There are 1229 such fields, each with degree [F : Q] 9. In this article, we consider the following prob...
John Voight
ANTS
2008
Springer
67views Algorithms» more  ANTS 2008»
15 years 9 months ago
Running Time Predictions for Factoring Algorithms
Ernie Croot, Andrew Granville, Robin Pemantle, Pra...
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
15 years 9 months ago
Abelian Varieties with Prescribed Embedding Degree
We present an algorithm that, on input of a CM-field K, an integer k 1, and a prime r 1 mod k, constructs a q-Weil number OK corresponding to an ordinary, simple abelian variety ...
David Freeman, Peter Stevenhagen, Marco Streng
ANTS
2008
Springer
106views Algorithms» more  ANTS 2008»
15 years 9 months ago
Computing in Component Groups of Elliptic Curves
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
J. E. Cremona