Tagged Questions
2
votes
1answer
169 views
Finding a solution to a (sort of) discrete logarithm by asking questions
Let $p = kq + 1$ and $q$ be primes such that $log$ $q = n$, $log$ $k = n$ and such that the bit size of every prime factor of $k$ is bounded
by $log$ $n$. Let $g$ be a generator of the unique ...
6
votes
3answers
434 views
Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?
This answer makes the claim that the Discrete Log problem and RSA are independent from a security perspective.
RSA labs makes a similar statement:
The discrete logarithm problem bears the same ...
