Accelerating Polynomial Multiplication for RLWE using Pipelined FFT

ePrint Report: Accelerating Polynomial Multiplication for RLWE using Pipelined FFT

Neil Thanawala, Hamid Nejatollahi, Nikil Dutt

The evolution of quantum algorithms threatens to break public key cryptography in polynomial time. The development of quantum-resistant algorithms for the post-quantum era has seen a significant growth in the field of
post quantum cryptography (PQC). Polynomial multiplication is the core of
Ring Learning with Error (RLWE) lattice based cryptography (LBC) which
is one of the most promising PQC candidates. In this work, we …

algorithms cryptography development eprint report growth key neil post-quantum pqc public public key quantum quantum algorithms quantum cryptography quantum-resistant report