/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.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. | |
| | | | |
www.johndcook.com
|
|
| | | | | Random number generator test services. We test RNGs using the standard test suites: PractRand, TestU01 (BigCrush), DIEHARD(ER), NIST SP 800-22. | |
| | | | |
andreabergia.com
|
|
| | | This post is part of the Languages Opinion series. Languages opinion - part one - JVM Languages opinion - part two - Rust ?thispost Languages opinion - part three - Javascript and Typescript Welcome back to my mini-series about programming languages. In this post, we will talk about one of the most interesting programming languages that I have seen in a long while: Rust. | ||
