Explore >> Select a destination
|
You are here 
|
cronokirby.com | ||
| | | | |
www.johndcook.com
|
|
| | | | | The Bitcoin key mechanism is based on elliptic curve cryptography over a finite field. This post gives a brief overview. | |
| | | | |
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. | |
| | | | |
blog.cryptographyengineering.com
|
|
| | | Update 6/10: Based on a short conversation with an engineering lead at X, some of the devices used at X are claimed to be using HSMs. See more further below. Matthew Garrett has a nice post about Twitter (uh, X)'s new end-to-end encryption messaging protocol, which is now called XChat. The TL;DR of Matthew's post... | ||
