Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
blog.openmined.org
|
|
| | | | | From the math and the hard problem behind most of today's homomorphic encryption scheme to implementing your own in python. | |
| | | | |
www.imperialviolet.org
|
|
| | | | | ||
| | | | |
jeremykun.com
|
|
| | | | | In this article I'll derive a trick used in FHE called sample extraction. In brief, it allows one to partially convert a ciphertext in the Ring Learning With Errors (RLWE) scheme to the Learning With Errors (LWE) scheme. Here are some other articles I've written about other FHE building blocks, though they are not prerequisites... | |
| | | | |
mathematicaloddsandends.wordpress.com
|
|
| | | I recently came across this theorem on John Cook's blog that I wanted to keep for myself for future reference: Theorem. Let $latex f$ be a function so that $latex f^{(n+1)}$ is continuous on $latex [a,b]$ and satisfies $latex |f^{(n+1)}(x)| \leq M$. Let $latex p$ be a polynomial of degree $latex \leq n$ that interpolates... | ||
