/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 www.ayoub-benaissa.com
Introduction to Homomorphic Encryption
| | blog.openmined.org
Build an Homomorphic Encryption Scheme from Scratch with Python
1.2 parsecs away

Travel
| | From the math and the hard problem behind most of today's homomorphic encryption scheme to implementing your own in python.
| | jeremykun.wordpress.com
Modulus Switching in LWE - Math Programming
1.3 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...
| | neilmadden.blog
On PBKDF2 iterations - Neil Madden
2.7 parsecs away

Travel
| | There has been a lot of discussion recently around the LastPass breach, especially with regards to the number of PBKDF2 iterations applied to the master password to derive the vault encryption key. Other people have already dissected this particular breach, but I want to more generally talk about PBKDF2 iterations and security models. (I'm not...
| | www.jeremykun.com
Estimating the Security of Ring Learning with Errors (RLWE) | Math Programming
18.4 parsecs away

Travel
| 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. The basis for many FHE schemes, as well as other privacy-preserving protocols, is the Learning With Errors (LWE) problem.