75 search results - page 8 / 15 » Hard Instances of the Constrained Discrete Logarithm Problem |
ANOR
2007
13 years 7 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
COR
2011
13 years 2 months ago
2011
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we ...
AAAI
1994
13 years 8 months ago
1994
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
ASIACRYPT
2004
Springer
14 years 28 days ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Di...