Outer Web | Explore

Explore >> Select a destination

You are here		www.jeremykun.com Polynomial Multiplication Using the FFT \|\| Math ? Programming
\|	\|	raganwald.com An ES6 function to compute the nth Fibonacci number	3.2 parsecs away Travel
\|	\|		3.2 parsecs away Travel
\|	\|	jeremykun.com Sample Extraction from RLWE to LWE - Math ? Programming	2.6 parsecs away Travel
\|	\|	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...	2.6 parsecs away Travel
\|	\|	jeremykun.wordpress.com Modulus Switching in LWE - Math ? Programming	3.4 parsecs away Travel
\|	\|	The Learning With Errors problem is the basis of a few cryptosystems, and a foundation for many fully homomorphic encryption (FHE) schemes. In this article I'll describe a technique used in some of these schemes called modulus switching. In brief, an LWE sample is a vector of values in $\mathbb{Z}/q\mathbb{Z}$ for some $q$, and in...	3.4 parsecs away Travel
\|	\|	basesandframes.wordpress.com Faster Math Functions - Bases and Frames	37.2 parsecs away Travel
\|		Download Presentation part 1 Download Presentation part 2 I was trying to interpolate a scaling function on an SPU on PS3 and realized, this device has no math library. How do you write powf() without access to libm? The IEEE754 standard for floating point numbers only covers five fundamental functions - addition, subtraction, multiplication, division...	37.2 parsecs away Travel