Explore >> Select a destination
|
You are here 
|
blog.openmined.org | ||
| | | | |
awwalker.com
|
|
| | | | | This post discusses the problem of computer-assisted decryption of un-parsed substitution ciphers. Sample Mathematica code is linked within. | |
| | | | |
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.... | |
| | | | |
www.daniellowengrub.com
|
|
| | | | | ||
| | | | |
www.jeremykun.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. The basis for many FHE schemes, as well as other privacy-preserving protocols, is the Learning With Errors (LWE) problem. | ||
