Sciweavers

128 search results - page 5 / 26
» ants 2006
Sort
View
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
15 years 10 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim
ANTS
2006
Springer
118views Algorithms» more  ANTS 2006»
15 years 10 months ago
Computation of Locally Free Class Groups
We show that the locally free class group of an order in a semisimple algebra over a number field is isomorphic to a certain ray class group. This description is then used to prese...
Werner Bley, Robert Boltje
ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
15 years 10 months ago
Computing Pro-P Galois Groups
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois grou...
Nigel Boston, Harris Nover
ANTS
2006
Springer
79views Algorithms» more  ANTS 2006»
15 years 10 months ago
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
John Cremona, Samir Siksek
ANTS
2006
Springer
75views Algorithms» more  ANTS 2006»
15 years 8 months ago
Symmetric Powers of Elliptic Curve L-Functions
Abstract. The conjectures of Deligne, Beilinson, and Bloch-Kato assert that there should be relations between the arithmetic of algebrogeometric objects and the special values of t...
Phil Martin, Mark Watkins