Submission timeline
2007–2026One slot for every year since HN launched. Height is that year's peak points; orange marks a 100+ point or 50+ comment breakout. Select a bar to open its strongest thread.
First comments on top threads
HN comment orderNit: the hard dependency on good randomness for ECDSA is a property of DSA in general, and not of elliptic curve cryptography. The DSA construction has what is probably the strictest randomness requirement in all of mainstream cryptography; a bias of just a few bits is, with repeated signatures, sufficient to recover private keys! (The attack that makes this work on ECDSA is extraordinarily cool). The problem with NIST Dual_EC_DRBG is simpler than the article makes it sounds. A good…
This is pretty good. You can probably skip to the "Strange Symmetry" section and read from there. Learning about elliptic curves made a lot of abstract algebra click for me, in ways it hadn't when I was just working with multiplicative groups for RSA and the like. That in turn made a lot of linear algebra make sense for me. The right place to start with elliptic curves with with standard Diffie Hellman, which you can nail down in 10…
The first top-level comment from each of the four biggest threads, in HN’s own order. Excerpts are shortened; open a comment for full context.
- Breakout years
- 2
- Total points
- 320
- Total comments
- 53
100+ points or 50+ comments
reference only — not used in Hall rules or ranking
reference only — not used in Hall rules or ranking
Every submission
| Date | Title as submitted | By | Points | Comments |
|---|---|---|---|---|
| 2013-10-24 | Primer on elliptic curve cryptographyFirst breakout · Best thread | andrewfong | 205 | 47 |
| 2016-02-23 | A (relatively easy) primer on elliptic curve cryptography (2013) | alanfranzoni | 2 | 0 |
| 2016-02-26 | A relatively easy to understand primer on elliptic curve cryptography (2013)Latest 20+ point return | vladaionescu | 113 | 6 |