Sciweavers

34 search results - page 2 / 7
» Algorithms for ray class groups and Hilbert class fields
Sort
View
MOC
1998
93views more  MOC 1998»
13 years 5 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
ANTS
2010
Springer
263views Algorithms» more  ANTS 2010»
13 years 8 months ago
Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
John Voight
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 5 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
CMA
2010
183views more  CMA 2010»
13 years 2 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis