[Ach] Applied Crypto Hardening
pg at futureware.at
Wed Dec 11 23:45:51 CET 2013
> > - In chap. 6 you mentioned: "The security of the RSA and
> Diffie-Hellman algorithms is based on the assumption that factoring
> > large primes is infeasable.
This is wrong, Diffie-Hellman does not depend on the factoring of large
primes, it depends on discrete logarithm.
But attacker-wise both problems are very similar, so if you break one of
them, you are likely able to break the other too.
More information about the Ach