/explore
|
You are here 
|
cronokirby.com | ||
| | | | |
www.bearssl.org
|
|
| | | | | ||
| | | | |
blog.trailofbits.com
Here at Trail of Bits we review a lot of code. From major open source projects to exciting new proprietary software, we've seen it all. But one common denominator in all of these systems is that for some inexplicable reason people still seem to think RSA is a good cryptosystem to use. Let me save [...] |
|
| | | | | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
windowsontheory.org
Guest post by Boaz Barak and Zvika Brakerski (part 2) In the previous post, we demonstrated the versatility of fully homomorphic encryption and its applicability for multiple applications. In this post we will demonstrate (not too painfully, we hope) how fully homomorphic encryption is constructed. Our goal is to present the simplest solution that (we... |
|
| | | |||
