![\"A](\"https://assets.buttondown.email/images/fc811646-65b3-4c41-9a2c-ff68584f75b5.jpeg?w=960&fit=max\")
We now know how the seeds of the NIST elliptic curves were generated: they’re not the hash of some saucy sentence, but the output of drand48 seeded with the time, which was indeed in 1997–98.
\nJohn Wood, Henry de Valence, Ava Howell, Zack Voase, Lucy Sweet, Amir Omidi, Paul Crowley, Iain McGinniss, Nicholas Carlini, and Steve Weis from Anthropic solved the riddle and on October 15th, 2026, at 01:07:51 UTC, claimed the full bounty I announced three years ago. They chose to donate the prize to ISRG, the non-profit that operates Let’s Encrypt, tripling its value to $36,864 (36 Ki$). Thank you to Amir Omidi, Chris Palmer, Colm MacCárthaigh, David Adrian, David Anderson, Jeff Hodges, Matt Green, Matthew McPherrin, Paul Kehrer, Ryan Sleevi, and Soatok for contributing to the bounty.
\nThis helps fill out a page of cryptographic history, and reinforces our confidence in these critical cryptographic primitives.
\nThe NIST elliptic curves (P-192, P-224, P-256, P-384, and P-521) were published by NIST in FIPS 186-2 in 2000. They were generated at random according to ANSI X9.62 by taking an arbitrary seed, hashing it with SHA-1, and using the output to derive some of the parameters. Until this week, we had no idea how those arbitrary seeds were picked.
\nThe lore was that Dr. Jerry Solinas, who passed away in early 2023, generated them in 1997 by hashing some English sentences that he later forgot. You can read more in this article by Steve Weis or in the original bounty announcement.
\nTurns out memory can play tricks on everyone: we now know they were instead generated with the POSIX-standard drand48 random number generator.
\nThe algorithm is as simple as passing the then-current UNIX timestamp to srand48() and then producing one byte at a time with drand48. Each sequence of 20 bytes is tried as a seed following ANSI X9.62 and rejected if the resulting curve is not valid. Some timestamps are used to generate multiple curves, by continuing to try seeds after accepting the first one. I reimplemented the algorithm in Go to verify the claim. Read more in Anthropic’s writeup.
There are two additional undocumented criteria beyond the ANSI X9.62 ones, one fairly clear and one that still escapes us.
\nIf the bit length of the order *n* of the resulting curve is more than the bit length of the base field *p* of the curve, the seed is rejected. (The condition is not the stricter *n* < *p*, because prime239v2 has *p* < *n* < 2²³⁹.)
\nThis leaves us with roughly twice as many valid seeds as were published. We explored a number of explanations for this last bit, and found no good fit. Maybe the same RNG was used to validate seeds, consuming RNG output and skipping some potential candidates, although the “gaps” are not regular. Maybe there was just a bug in one of the algorithms that returned the wrong result half the time; these calculations, which we can now do with off-the-shelf software in minutes, were still very much state-of-the-art in 1997.
\nsrand48(863711343) [1997-05-15 15:49:03 +0000 UTC]:\n accepted 36th seed 25e5[...]: not published\n accepted 1562nd seed d09b[...]: not published\n accepted 2185th seed e43b[...]: prime239v1\n accepted 2320th seed e8b4[...]: prime239v2\n accepted 2491st seed 1256[...]: not published\n accepted 2682nd seed d2c1[...]: not published\n accepted 2863rd seed 3a70[...]: not published\n accepted 3048th seed 7d73[...]: prime239v3\nsrand48(863966734) [1997-05-18 14:45:34 +0000 UTC]:\n accepted 139th seed 3045[...]: P-192 a.k.a. prime192v1\n accepted 2198th seed 692d[...]: not published\n accepted 5228th seed c469[...]: prime192v3\n accepted 5405th seed 3ad1[...]: not published\n accepted 6013th seed 31a9[...]: prime192v2\nsrand48(871002724) [1997-08-08 01:12:04 +0000 UTC]:\n accepted 1136th seed d09e[...]: P-521\nsrand48(871696354) [1997-08-16 01:52:34 +0000 UTC]:\n accepted 876th seed 50c7[...]: not published\n accepted 1842nd seed c49d[...]: P-256 a.k.a. prime256v1\nsrand48(872952608) [1997-08-30 14:50:08 +0000 UTC]:\n accepted 2688th seed a335[...]: P-384\nsrand48(891607927) [1998-04-03 12:52:07 +0000 UTC]:\n accepted 777th seed d007[...]: not published\n accepted 1485th seed 18cf[...]: not published\n accepted 5736th seed 3c17[...]: not published\n accepted 7026th seed bd71[...]: P-224What does this mean for the security of elliptic curve cryptography based on the NIST curves? Well, even before this discovery there were no serious concerns among practitioners. In Section 3.1 of their 2015 paper “A riddle wrapped in an enigma,” Koblitz and Menezes make a convincing argument that it’s implausible that the NSA could have selected a seed to exploit a weakness that escaped more than 15 (now 25) years of cryptanalysis.
\nHowever, as reported in a later version of that paper, Daniel Bernstein and Tanja Lange described to Koblitz and Menezes in 2017 a technique that could have exploited 70 bits of freedom in selection of the seed to target a hypothetical class of 2⁶¹ weak prime-order curves. (Bernstein is the author of a competing elliptic curve design, Curve25519.) This contributed to enduring conspiracy theories, which had significant appeal among the non-specialist public (although many have since moved on to other, adjacent, conspiracy theories). All this speculation harmed confidence in robust cryptographic systems and was part of my motivation for the bounty.
\nThis week’s findings completely rule out the technique described by Bernstein and Lange. Even if the NSA had been free to pick any timestamp in 1997–98 and any of the first 16 prime-order candidates (which generously accounts for the unexplained rejections), they would have had barely 30 bits of freedom. Not enough to intentionally target a hypothetical small class of weak curves, not enough to embed any kind of NOBUS backdoor.
\nAlong with deterministic and hedged ECDSA signing algorithms, formally verified field implementations, and the 2015 complete addition formulas by Renes, Costello, and Batina, this nicely completes the “rehabilitation arc” of NIST elliptic curve cryptography, which I would now personally recommend over Curve25519/Ed25519/X25519.
\nJust in time for them to be retired in favor of post-quantum signatures.
\nP.S. The Anthropic team also figured out how the seeds of the NIST B-curves (the ones over binary fields) were generated, but no one uses those, so who cares.
\nIn a FamilyMart in Taiwan I found this delightful dice set. A full roll carries log₂(6²⁰) ≈ 51.7 bits of entropy. Rolling them twice can make a pretty robust cryptographic key!
\nI thought it would be funny to label them as Geomys FIPS 140-3 Entropy Sources (which of course they are not, though we do have one of those) and hand them out as swag. However, I found no way to order them online, so I simply visited over a dozen FamilyMarts and brought home 50 packs.
\nSpeaking of swag, I am 100% making stickers with the srand48() seeds, and t-shirts for the Anthropic team and the contributors to the bounty. I accept suggestions for other seed-based swag. If you want to catch some, follow me on Bluesky at @filippo.abyssdomain.expert or on Mastodon at @filippo@abyssdomain.expert.