54 search results - page 2 / 11 » An Algorithm for Solving the Discrete Log Problem on Hyperel... |
AAECC
2005
Springer
13 years 4 months ago
2005
Springer
The ideal class group of hyperelliptic curves can be used in cryptosystems based on the discrete logarithm problem. In this article we present explicit formulae to perform the gro...
ANTS
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
MOC
1998
13 years 4 months ago
1998
On the basis of a fully discrete trigonometric Galerkin method and two grid iterations we propose solvers for integral and pseudodifferential equations on closed curves which solv...
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...