Explore >> Select a destination
|
You are here 
|
www.bearssl.org | ||
| | | | |
orlp.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.nayuki.io
|
|
| | | | | ||
| | | | |
sansmap.wordpress.com
|
|
| | | hand written text by shel silverstein, poem published in his book 'Falling Up'; 1996 | ||
