[Resource Topic] 2006/253: Hard Instances of the Constrained Discrete Logarithm Problem

Welcome to the resource topic for 2006/253

Hard Instances of the Constrained Discrete Logarithm Problem

Authors: Ilya Mironov, Anton Mityagin, Kobbi Nissim


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ös et~al. and Schnorr, develop geometric tools such as generalized Menelaus’ theorem for proving lower bounds on the complexity of the constrained DLP, and construct sets with succinct representation with provable non-trivial lower bounds.

ePrint: https://eprint.iacr.org/2006/253

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .