Homomorphic Encryption, Optical Computing, Silicon Photonics, Post Quantum Cryptography.
Fourier transform of each polynomial. In electronic systems, the Fourier transform has algorithmic complexity O(n log(n)) Performing the element-wise multiplication of the two polynomials in Fourier space, an operation with algorithmic complexity O(n) Performing the inverse Fourier transform (also