Homomorphic Encryption, Optical Computing, Silicon Photonics, Post Quantum Cryptography.
we’re using the method taught in schools, then the algorithmic complexity in multiplying two polynomials of the same length together is O(n²). However, there’s a more efficient calculation method that uses the Fourier transform; multiplying two polynomials together is equivalent to: Taking the