Explore >> Select a destination
|
You are here 
|
www.rareskills.io | ||
| | | | |
vitalik.eth.limo
|
|
| | | | | ||
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] The text provides an in-depth explanation of elliptic curve cryptography (ECC), covering fundamental concepts such as elliptic curves over finite fields, point addition, cyclic subgroups, subgroup orders, and the discrete logarithm problem. It also discusses practical aspects like finding base points, cofactors, and the importance of choosing subgroups with high order for cryptographic security. The text emphasizes that ECC relies on the difficulty of solving the discrete logarithm problem on elliptic curves, which is considered computationally hard and forms the basis for secure cryptographic protocols like ECDH and ECDSA. | |
| | | | |
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. | |
| | | | |
scottarc.blog
|
|
| | | A very high-level view of [hybrid] post-quantum cryptography. | ||
