Explore >> Select a destination
|
You are here 
|
andrea.corbellini.name | ||
| | | | |
blog.lambdaclass.com
|
|
| | | | | Elliptic curves (EC) have become one of the most useful tools for modern cryptography. They were proposed in the 1980s and became widespread used after 2004. Its main advantage is that it offers smaller key sizes to attain the same level of security of other methods, resulting in smaller storage | |
| | | | |
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
|
|
| | | | | The Bitcoin key mechanism is based on elliptic curve cryptography over a finite field. This post gives a brief overview. | |
| | | | |
nickhar.wordpress.com
|
|
| | | The algorithm for probabilistically embedding metric spaces into trees has numerous theoretical applications. It is a key tool in the design of many approximation algorithms and online algorithms. Today we will illustrate the usefulness of these trees in designing an algorithm for the online Steiner tree problem. 1. Online Steiner Tree Let $latex {G=(V,E)}&fg=000000$ be... | ||
