Explore >> Select a destination
|
You are here 
|
words.filippo.io | ||
| | | | |
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.cr.yp.to
|
|
| | | | | ||
| | | | |
cronokirby.com
|
|
| | | | | - Read more: https://cronokirby.com/posts/2021/04/constant-time-big-numbers-introduction/ | |
| | | | |
binarydebt.wordpress.com
|
|
| | | In our last post we covered how x86 logical address is translated into linear address. In this one we will look at translation from linear to physical. We will use the terms 'virtual address' and 'linear address' interchangeably. A piece of hardware called paging unit is responsible for converting virtual addresses to physical. However, the... | ||
