Homomorphic Encryption, Optical Computing, Silicon Photonics, Post Quantum Cryptography.
multiplication in Fourier space, 4. compute the inverse Fourier transform, 5. add a phase opposite to that of the first step. Steps 1, 3, and 5 have a linear complexity. The first and last steps are required to ensure the multiplication is performed in the correct ring of multinomials: without the