[Ach] Applied Crypto Hardening

Aaron Zauner azet at azet.org
Thu Dec 12 00:07:38 CET 2013

Yes. I'm aware of that, that's why I said that my edit probably did more
harm than good (i.e. removing DPL and adding prime factoring without
splitting both in two sentences). I rewrote large parts of the document
that evening and simply forgot to change that mistake.

I've just replaced that part with Bergs suggestion:

Thanks & Mea culpa!

On Wed, Dec 11, 2013 at 11:45 PM, Philipp Gühring <pg at futureware.at> wrote:

> Hi,
> > > - In chap. 6 you mentioned: "The security of the RSA and
> > Diffi e-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.
> Best regards,
> Philipp
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.cert.at/pipermail/ach/attachments/20131212/01826692/attachment.html>

More information about the Ach mailing list