New blog post "Fast-key-erasure random-number generators": https://blog.cr.yp.to/20170723-random.html … An effort to clean up several messes simultaneously.
Caching RNG output is a common optimization, even for urandom, but I've had to remove it several times from things.
-
-
Typical RNG code (e.g., OpenSSL RAND_bytes) takes longer to generate 1 byte than a fast-key-erasure RNG takes to fill up a 768-byte buffer.
-
That's compelling, but I still don't want jitter. Seems easy enough to do.
- 4 more replies
New conversation -
-
-
I don't think it's more complicated, just changes the scope of r, pos. In fastrandombytes. Same alg.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.