/explore
|
You are here 
|
rot256.dev | ||
| | | | |
www.jeremykun.com
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. |
|
| | | | | ||
| | | | |
andrea.corbellini.name
[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. |
|
| | | | | ||
| | | | |
blog.lambdaclass.com
Introduction STARKs (scalable transparent arguments of knowledge) have gained a lot of attention in recent years due to their capacity to help scale Ethereum and other L1s. They provide a way to guarantee the integrity of a computation carried out by an untrusted party via cryptographic proof. This proof can |
|
| | | | | ||
| | | | |
kevquirk.com
Ever wondered how websites check your password? I mean, how can they check your password without being able to read it? It's a catch 22, surely? |
|
| | | |||
