/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 rot256.dev
ROT256 : Cryptography & Other Random Bits.
| | andrea.corbellini.name
Elliptic Curve Cryptography: finite fields and discrete logarithms - Andrea Corbellini
10.5 parsecs away

Travel
| | [AI summary] A technical blog post explaining elliptic curves over finite fields, covering modular arithmetic, point addition algorithms, cyclic subgroups, and the discrete logarithm problem in the context of cryptography.
| | vitalik.eth.limo
An approximate introduction to how zk-SNARKs are possible
7.7 parsecs away

Travel
| | [AI summary] An accessible technical introduction explaining how zk-SNARKs use polynomials, finite fields, and polynomial commitments to create succinct and private zero-knowledge proofs.
| | www.jeremykun.com
Negacyclic Polynomial Multiplication | Math Programming
9.6 parsecs away

Travel
| | In this article I'll cover three techniques to compute special types of polynomial products that show up in lattice cryptography and fully homomorphic encryption. Namely, the negacyclic polynomial product, which is the product of two polynomials in the quotient ring $\mathbb{Z}[x] / (x^N + 1)$. As a precursor to the negacyclic product, we'll cover the simpler cyclic product. All of the Python code written for this article is on GitHub.
| | www.imperialviolet.org
ImperialViolet - Elliptic curves and their implementation
17.3 parsecs away

Travel
| [AI summary] An in-depth technical explanation of elliptic curve cryptography, covering mathematical foundations, group structures, implementation challenges, and optimization techniques for finite field arithmetic.