Explore >> Select a destination
|
You are here 
|
cronokirby.com | ||
| | | | |
soatok.blog
|
|
| | | | | Recently, it occurred to me that there wasn't a good, focused resource that covers commitments in the context of asymmetric cryptography. I had covered confused deputy attacks in my very short (don't look at the scroll bar) blog post on database cryptography., and that's definitely relevant. I had also touched on the subject of commitment... | |
| | | | |
andrea.corbellini.name
|
|
| | | | | ||
| | | | |
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. | |
| | | | |
theniceweb.com
|
|
| | | |||
