Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
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... | |
| | | | |
jeremykun.wordpress.com
|
|
| | | | | 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... | |
| | | | |
awwalker.com
|
|
| | | | | This post discusses the problem of computer-assisted decryption of un-parsed substitution ciphers. Sample Mathematica code is linked within. | |
| | | | |
www.daniellowengrub.com
|
|
| | | [AI summary] The text discusses the implementation of homomorphic operations in the context of RLWE (Ring Learning With Errors) and GSW (Gentry-Sahai-Waters) encryption schemes. Key concepts include the use of encryptions of zero to facilitate homomorphic multiplication, the structure of GSW ciphertexts as matrices of RLWE ciphertexts, and the role of scaling factors to manage error growth during multiplication. The main goal is to enable secure computation of polynomial products without revealing the underlying plaintexts. | ||
