NTT-Based Polynomial Modular Multiplication for Homomorphic Encryption: A Tutorial. (arXiv:2306.12519v1 [cs.CR])

Homomorphic Encryption (HE) allows any third party to operate on the
encrypted data without decrypting it in advance. For the majority of HE
schemes, the multiplicative depth of circuits is the main practical limitation
in performing computations over encrypted data. Hence, Homomorphic
multiplication is one of the most important components of homomorphic
encryption. Since most of the HE schemes are constructed from the ring-learning
with errors (R-LWE) problem. Efficient polynomial modular multiplication
implementation becomes critical. This work consists of describing …

data encrypted encrypted data encryption homomorphic encryption important main modular ntt party performing third tutorial