75 search results - page 2 / 15 » Hard Instances of the Constrained Discrete Logarithm Problem |
INDOCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...
FC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Systems for the support of customer relationship management are becoming increasingly attractive for vendors. Loyalty systems provide an interesting possibility for vendo...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...
CCS
2008
ACM
13 years 7 months ago
2008
ACM
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
CEC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— Meta-heuristic optimization approaches are commonly applied to many discrete optimization problems. Many of these optimization approaches are based on a local search op...