Explore >> Select a destination
|
You are here 
|
www.imperialviolet.org | ||
| | | | |
andrea.corbellini.name
|
|
| | | | | ||
| | | | |
www.johndcook.com
|
|
| | | | | The Bitcoin key mechanism is based on elliptic curve cryptography over a finite field. This post gives a brief overview. | |
| | | | |
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.reedbeta.com
|
|
| | | When you read BRDF theory papers, you'll often see mention of slope space. Sometimes, components of the BRDF such as NDFs or masking-shadowing functions are defined in slope space, or operations are done in slope space before being converted back to ordinary vectors or polar coordinates. However, the meaning and intuition of slope space is rarely explained. Since it may not be obvious exactly what slope space is, why it is useful, or how to transform things to and from it, I thought I would write down a ... | ||
