Sciweavers

28 search results - page 1 / 6
» Computing ray class groups, conductors and discriminants
Sort
View
MOC
1998
93views more  MOC 1998»
13 years 7 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
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
ANTS
2006
Springer
118views Algorithms» more  ANTS 2006»
13 years 11 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
EUROCRYPT
1998
Springer
13 years 12 months ago
A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption
We introduce a new cryptosystem with trapdoor decryption based on the di culty of computing discrete logarithms in the class group of the non-maximal imaginary quadratic order O q ...
Detlef Hühnlein, Michael J. Jacobson Jr., Sac...
CHI
2005
ACM
14 years 8 months ago
Improving orchestral conducting systems in public spaces: examining the temporal characteristics and conceptual models of conduc
Designing interactive conducting exhibits for public spaces poses unique challenges, primarily because the conceptual model of conducting music varies amongst users. In a user stu...
Eric Lee, Marius Wolf, Jan Borchers