Explore >> Select a destination
|
You are here 
|
cronokirby.com | ||
| | | | |
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. | |
| | | | |
words.filippo.io
|
|
| | | | | A lot of new cryptography is landing in Go 1.20, including the new crypto/ecdh package and math/big-less RSA and ECDSA backends! | |
| | | | |
blog.trailofbits.com
|
|
| | | | | Here at Trail of Bits we review a lot of code. From major open source projects to exciting new proprietary software, we've seen it all. But one common denominator in all of these systems is that for some inexplicable reason people still seem to think RSA is a good cryptosystem to use. Let me save [...] | |
| | | | |
smartnets.etrovub.be
|
|
| | | CurveForge: generic, constant-time elliptic curves by construction in Rust. Or: how we implemented Montgomery curves in a few hours instead of a few weeks. | ||
