Hard Instances of the Constrained Discrete Logarithm Problem

• Published in: arXiv.org
• Main Authors: Mironov, Ilya, Mityagin, Anton, Kobbi Nissim
• Format: Paper
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 24.07.2006
• Subjects: Algorithms; Complexity; Cryptography; Lower bounds; Representations

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 se...