Explore >> Select a destination
|
You are here 
|
0fps.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. | |
| | | | |
www.eigentales.com
|
|
| | | | | The factor graph is a beautiful tool for visualizating complex matrix operations and understanding tensor networks, as well as proving seemingly complicated properties through simple visual proofs. | |
| | | | |
fredrikj.net
|
|
| | | | | ||
| | | | |
www.analyticsvidhya.com
|
|
| | | Explore RNNs: their unique architecture, working principles, BPTT, pros/cons, and Python implementation using Keras. | ||
