Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
jeremykun.wordpress.com
|
|
| | | | | This article was written by my colleague, Cathie Yun. Cathie is an applied cryptographer and security engineer, currently working with me to make fully homomorphic encryption a reality at Google. She's also done a lot of cool stuff with zero knowledge proofs. In previous articles, we've discussed techniques used in Fully Homomorphic Encryption (FHE) schemes.... | |
| | | | |
sander.ai
|
|
| | | | | Even faster convolutions in Theano using Fast Fourier Transforms | |
| | | | |
cp4space.hatsya.com
|
|
| | | | | A couple of years ago I described a primep which possesses various properties that renders it useful for computing number-theoretic transforms over the field $latex \mathbb{F}_p$. Specifically, we have: $latex p = \Phi_{192}(2) = \Phi_6(2^{32}) = 2^{64} - 2^{32} + 1$ where the first of these equalities uses the identity that: $latex \Phi_{k}(x) = \Phi_{rad(k)}(x^{k/rad(k)})$... | |
| | | | |
andrewshitov.com
|
|
| | | |||
