[Ach] Applied Crypto Hardening

[L. Aaron Kaplan]

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
>> 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.

Well, complexity wise you can transform these problems.

Have a look: http://www.mccurley.org/papers/dlog.pdf


or (simpler): http://crypto.stackexchange.com/questions/9385/reduction-of-integer-factorization-to-discrete-logarithm-problem


==> 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 --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 163 bytes
Desc: Message signed with OpenPGP using GPGMail
URL: <http://lists.cert.at/pipermail/ach/attachments/20131212/e0431f39/attachment.sig>