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. | |
| | | | |
andrea.corbellini.name
|
|
| | | | | ||
| | | | |
scottarc.blog
|
|
| | | | | This isn't (necessarily) a security vulnerability; merely an observation that I don't think has been articulated adequately within the cryptography community. I thought it would be worth capturing somewhere public so that others can benefit from a small insight when designing cryptosystems. Background Once upon a time, there was Symmetric Encryption, which provided confidentiality, but... | |
| | | | |
nhigham.com
|
|
| | | The Cayley-Hamilton Theorem says that a square matrix $LATEX A$ satisfies its characteristic equation, that is $latex p(A) = 0$ where $latex p(t) = \det(tI-A)$ is the characteristic polynomial. This statement is not simply the substitution ``$latex p(A) = \det(A - A) = 0$'', which is not valid since $latex t$ must remain a scalar... | ||
