Explore >> Select a destination
|
You are here 
|
blog.lambdaclass.com | ||
| | | | |
rot256.dev
|
|
| | | | | Introduction In this post we will take a look at the Fast Reed-Solomon IOP (FRI) proximity test, which enables an untrusted prover to convince a verifier that a committed vector is close to a Reed-Solomon codeword with communication only poly-logarithmic in the dimension of the code. This is readily used to construct practically efficient zkSNARKs from just cryptographic hash functions (rather random oracles), without the need for a trusted setup. | |
| | | | |
blog.nuculabs.de
|
|
| | | | | This is my first book review that I did my blog, I'm not really good at reviewing books and I'm not a native english speaker either, so bear with me and my clumsy english. I must also say that the subject covered by the book overwhelms me, I don't claim to be an expert on the topic and and to be honest I don't really want to become one, reading this book has provided me with enough information in order to be able to hold a basic discussion about cryptography related topics, had I put more effort, time and thought in this book I could probably become proficient. | |
| | | | |
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. | |
| | | | |
berty.tech
|
|
| | | You have probably already heard about cryptography and, more specifically, about end-to-end encryption. But do you know what it really is? | ||
