16 search results - page 2 / 4 » An Improvement to the Gaudry-Schost Algorithm for Multidimen... |
ASIACRYPT
2003
Springer
13 years 10 months ago
2003
Springer
We present a variation of the index calculus attack by Gaudry which can be used to solve the discrete logarithm problem in the Jacobian of hyperelliptic curves. The new algorithm h...
ACISP
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic fi...
PODC
2004
ACM
13 years 11 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
COCOON
2000
Springer
13 years 10 months ago
2000
Springer
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...