|
You are here |
modexp.wordpress.com | ||
| | | | |
www.brianbondy.com
|
|
| | | | | Brian Bondy - Father, runner, software engineer, entrepreneur, and writer. | |
| | | | |
www.johndcook.com
|
|
| | | | | Example of a cryptographically secure random number generator with Python sample code | |
| | | | |
awwalker.com
|
|
| | | | | This post discusses the problem of computer-assisted decryption of un-parsed substitution ciphers. Sample Mathematica code is linked within. | |
| | | | |
www.jeremykun.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 LWE cryptosystems an LWE sample can be modified so that it hides a secret message $m$. | ||