Explore >> Select a destination

You are here

 www.jeremykun.com
Polynomial Multiplication Using the FFT || Math ? Programming
| | jeremykun.wordpress.com
Modulus Switching in LWE - Math ? Programming
2.2 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...
| | raganwald.com
An ES6 function to compute the nth Fibonacci number
3.3 parsecs away

Travel
| |
| | blog.paulhankin.net
A novel and efficient way to compute Fibonacci numbers
2.4 parsecs away

Travel
| | Programming, Computer Science, Games and Other Things
| | paragonie.com
You Wouldn't Base64 a Password - Cryptography Decoded - Paragon Initiative Enterprises Blog
18.8 parsecs away

Travel
| A human-readable overview of commonly misused cryptography terms and fundamental concepts.