News for hackers. Stuff that matters.
Re:Practical Cryptography With Go by j2kun on Monday April 14, 2014 @07:07PM (#7589426)
So you're saying that there is something inherently insecure about the constants defining the curves themselves. I've read some of Bernstein's stuff on 25519, and everything there is about selling curve25519 as making the engineering challenges easier by avoiding common pitfalls of the Weierstrass normal form.

And I can't find anyone anywhere giving evidence of mathematical insecurity of any NIST standard curves. Evidence might come in the form of a (significantly more than state of the art)-subexponential but still superpolynomial time algorithm. Dual_EC has something even better: a proof of insecurity.

Re:Practical Cryptography With Go by tptacek on Monday April 14, 2014 @07:19PM (#7589470)
Re:Practical Cryptography With Go by j2kun on Friday April 18, 2014 @10:10AM (#7609177)
And I quote, "So what's the problem? Answer: If you implement the NIST curves, chances are you're doing it wrong"

This is just reinforcing my point. There is nothing known to be mathematically wrong with the standard curves. Bernstein just warns against all the (admittedly many) pitfalls in implementations, and that the Weierstrass normal form makes it easier to run into problems than the normal form he proposes. This is the only reason he says NIST doesn't guarantee security, and of course they don't guarantee against engineering errors.

But that's extremely different from saying NSA planted backdoored curves intentionally. The only thing in Bernstein's analysis that I could possibly construe as suggesting malicious behavior is that the NIST curves are outdated (the suggestion being that they are intentionally left outdated).