/explore
|
You are here 
|
blog.cryptographyengineering.com | ||
| | | | |
negativesign.com
This one hits close to home. I can't imagine how the NIST staff involved in creating SP 800 (and more specifically, the SP 800-90A Dual Elliptic Curve Deterministic Random Bit Generation...bit) must feel. First of all, given the definition of a deterministic system, the title itself gives me pause. Maybe there's some next-level random number theory described in the standard, but I'm not sure I'd ever want a random number generator to exhibit deterministic behavior. |
|
| | | | | ||
| | | | |
www.2uo.de
[AI summary] A technical deep-dive that debunks common myths about the Linux /dev/urandom and /dev/random devices, arguing that /dev/urandom is the preferred and secure choice for cryptographic applications on modern systems. |
|
| | | | | ||
| | | | |
www.jeremykun.com
So far in this series we've seen elliptic curves from many perspectives, including the elementary, algebraic, and programmatic ones. We implemented finite field arithmetic and connected it to our elliptic curve code. So we're in a perfect position to feast on the main course: how do we use elliptic curves to actually do cryptography? History As the reader has heard countless times in this series, an elliptic curve is a geometric object whose points have a surprising and well-defined notion of addition. |
|
| | | | | ||
| | | | |
paragonie.com
A human-readable overview of commonly misused cryptography terms and fundamental concepts. |
|
| | | |||
