75 search results - page 3 / 15 » Hard Instances of the Constrained Discrete Logarithm Problem |
CEC
2007
IEEE
14 years 4 days ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
In financial engineering the problem of portfolio selection has drawn much attention in the last decades. But still unsolved problems remain, while on the one hand the type of mod...
SARA
2009
Springer
14 years 10 days ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
CRYPTO
2000
Springer
13 years 10 months ago
2000
Springer
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pse...
SCN
2004
Springer
13 years 11 months ago
2004
Springer
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...