Hard Instances of the Constrained Discrete Logarithm Problem

The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the set. Motivated by cryptographic applications, we study sets with succinct representation for which the constrained DLP is hard. We draw on earlier results due to Erd

• Type: Conference
• Year: 2006
• Where: ANTS
• Authors: Ilya Mironov, Anton Mityagin, Kobbi Nissim
• Keywords: Algorithms, ANTS 2006, Constrained Dlp, Discrete Logarithm Problem, Succinct Representation