[Ach] Applied Crypto Hardening
azet at azet.org
Thu Dec 12 00:52:04 CET 2013
But that's not a section on complexity theory. So being clear about the
distinction between the mathematical foundations that provide security of
both algorithms is necessary for the reader. This section is quite short
for such a complicated topic and maybe a bit too "technical" - if someone
wants to add a couple of sentences in between sentences and statements to
further explain stuff - please do so. That'd probably be a good idea and
On Thu, Dec 12, 2013 at 12:24 AM, L. Aaron Kaplan <kaplan at cert.at> wrote:
> On 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.
> Well, complexity wise you can transform these problems.
> Have a look: http://www.mccurley.org/papers/dlog.pdf
> or (simpler):
> ==> effect: both sentences were correct (if viewed through the angle of
> complexity theory)
> In this sense, I feel like perfectly fine with the original sentence as
> well :)
> > 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
> > _______________________________________________
> > Ach mailing list
> > Ach at lists.cert.at
> > http://lists.cert.at/cgi-bin/mailman/listinfo/ach
> // L. Aaron Kaplan <kaplan at cert.at> - T: +43 1 5056416 78
> // CERT Austria - http://www.cert.at/
> // Eine Initiative der nic.at GmbH - http://www.nic.at/
> // Firmenbuchnummer 172568b, LG Salzburg
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Ach