75 search results - page 12 / 15 » Hard Instances of the Constrained Discrete Logarithm Problem |
EUROCRYPT
2001
Springer
14 years 3 hour ago
2001
Springer
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
TOG
2008
13 years 7 months ago
2008
We present a new discretization for the physics-based animation of developable surfaces. Constrained to not deform at all in-plane but free to bend out-of-plane, these are an exce...
ASIACRYPT
2001
Springer
13 years 11 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
MST
2010
13 years 2 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
EUROCRYPT
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...