Two Algorithms for Fast GPU Implementation of NTT

ePrint Report: Two Algorithms for Fast GPU Implementation of NTT

Ali Şah Özcan, Erkay Savaş

The number theoretic transform (NTT) permits a very efficient method to perform multiplication of very large degree polynomials, which is the most time-consuming operation in fully homomorphic encryption (FHE) schemes and a class of non-interactive succinct zero-knowledge proof systems such as zk-SNARK. Efficient modular arithmetic plays an important role in the performance of NTT, and therefore it is studied extensively. The access pattern to the …

algorithms class consuming encryption eprint report fast fhe fully homomorphic encryption gpu homomorphic encryption implementation knowledge large non ntt report