2 ms·
It's called index calculus[1]. Basically, it allows you to do a (huge) amount of work that can be factored out from breaking specific DH exchanges, as long as t
by johncolanduoni 11y ago
It's called index calculus[1]. Basically, it allows you to do a (huge) amount of work that can be factored out from breaking specific DH exchanges, as long as the same prime is used. Since finding good DH primes is far more expensive than coming up with good primes for RSA, these primes tend to be reused on a massive scale.
[1]: https://en.wikipedia.org/wiki/Index_calculus_algorithm https://en.wikipedia.org/wiki/Index_calculus_algorithm
- bvandersloot 11y agoTraditionally, index calculus attempts for record discrete log calculations attempt to balance the "precomputation" step and the individual log calculation much more closely than in this work. This is more efficient if you only intend to perform one discrete log. One of the contributions here is that because of the massive reuse of primes, it would be more useful in a practical attack to shift much of the work into the steps solely dependent on the primes.
- dheera 11y agoThis system sounds incredibly insecure to me. What are the benefits of this over just plain old RSA with everyone using their own keys?
- minitech 11y agoForward secrecy in the event of a compromised key.