Explore >> Select a destination
|
You are here 
|
keymaterial.net | ||
| | | | |
mathvoices.ams.org
|
|
| | | | | Mathematically, the most intriguing of the new proposals use lattices for message encryption... What will they do when quantum computers start working? Bill Casselman University of British Columbia Commercial transactions on the internet are invariably passed through a process that hides them from unauthorized parties, using RSA public key encryption (named after the authors of... | |
| | | | |
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. | |
| | | | |
dusty.phillips.codes
|
|
| | | | | The venerable RSA public key encryption algorithm is very elegant. It requires a basic understanding of modular arithmetic, which may sound scary if you havent studied it. It reduces to taking the remainder after integer long division. The RSA Wikipedia article describes five simple steps to generate the keys. Encryption and decryption are a matter of basic exponentiation. Theres no advanced math, and its easy to understand their example of working with small numbers. | |
| | | | |
petertodd.org
|
|
| | | In the recent discussions around the Bitcoin Core capacity increasesplan and blocksizehard forks there's been a persistent stream of misunderstandings about ... | ||
