Explore >> Select a destination
|
You are here 
|
0fps.net | ||
| | | | |
jiggerwit.wordpress.com
|
|
| | | | | In the texbook I'm using for a first course in algebraic geometry, the proof of Bezout's theorem is awful. Looking around, I find an abundance of awful proofs. A good proof is one that I would want to commit to memory. Here is a good proof of Bezout's theorem, which is due to Gurjar and... | |
| | | | |
fredrikj.net
|
|
| | | | | ||
| | | | |
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. | |
| | | | |
paragonie.com
|
|
| | | A developer's short guide to encryption, authentication, and authenticated encryption with examples in PHP | ||
