Explore >> Select a destination
|
You are here 
|
awwalker.com | ||
| | | | |
www.vanimpe.eu
|
|
| | | | | Cryptography Introduction Cheatsheet, Private Communications in a Public World | |
| | | | |
modexp.wordpress.com
|
|
| | | | | Introduction Compressed, encrypted, and random data all contain a high amount of entropy, which is why many products use entropy analysis to detect malicious code in binaries that have never been examined before. In a previous post about masking, I suggested using a deterministic random number generator with the Fisher-Yates shuffle to try and scramble... | |
| | | | |
www.jeremykun.com
|
|
| | | | | Last time we covered an operation in the LWE encryption scheme called modulus switching, which allows one to switch from one modulus to another, at the cost of introducing a small amount of extra noise, roughly $\sqrt{n}$, where $n$ is the dimension of the LWE ciphertext. This time we'll cover a more sophisticated operation called key switching, which allows one to switch an LWE ciphertext from being encrypted under one secret key to another, without ever knowing either secret key. | |
| | | | |
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... | ||
