On modular k-free sets

Let $n$ and $k$ be integers. A set $A\subset\mathbb{Z}/n\mathbb{Z}$ is $k$-free if for all $x$ in $A$, $kx\notin A$. We determine the maximal cardinality of such a set when $k$ and $n$ are coprime. We also study several particular cases and we propose an efficient algorithm for solving the general case. We finally give the asymptotic behaviour of the minimal size of a $k$-free set in $\left[ 1,n\right]$ which is maximal for inclusion

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\"os 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