144 search results - page 15 / 29 » Fusion Discrete Logarithm Problems |
INDOCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
AAECC
2005
Springer
13 years 9 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...
ACSC
2008
IEEE
14 years 3 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
COMPGEOM
2010
ACM
14 years 2 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...
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...