A method for deciding whether the Galois group is abelian
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Partial solvability by radicals
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Do all elliptic curves of the same order have the same difficulty of discrete log?
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
An algorithm for computing p-class groups of abelian number fields
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
| Hi-index | 0.00 |