/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

 cp4space.hatsya.com
The Osmiumlocks Prime | Complex Projective 4-Space
| | unorde.red
What is Diffie-Hellman?
6.3 parsecs away

Travel
| | [AI summary] This article explains the Diffie-Hellman key exchange algorithm, its mathematical foundation in discrete logarithm problems, and its security implications in modern cryptography.
| | jeremykun.wordpress.com
Modulus Switching in LWE - Math Programming
5.9 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...
| | www.jeremykun.com
Polynomial Multiplication Using the FFT | Math Programming
4.7 parsecs away

Travel
| | Problem: Compute the product of two polynomials efficiently. Solution: import numpy from numpy.fft import fft, ifft def poly_mul(p1, p2): """Multiply two polynomials. p1 and p2 are arrays of coefficients in degree-increasing order. """ deg1 = p1.shape[0] - 1 deg2 = p1.shape[0] - 1 # Would be 2*(deg1 + deg2) + 1, but the next-power-of-2 handles the +1 total_num_pts = 2 * (deg1 + deg2) next_power_of_2 = 1 << (total_num_pts - 1).
| | blog.basistheory.com
What is data encryption?
17.3 parsecs away

Travel
| A deep dive into the fundamentals of data encryption, from symmetric vs. asymmetric algorithms to encryption at rest and in transit.