As the core operation of lattice cipher, large-scale polynomial multiplication is the biggest
computational bottleneck in its realization process. How to quickly calculate polynomial …

In general, most of the operations performed by any complex system need a multiplier.
Hence, multiplier based on FFT is the desired aim. In this paper, we have presented a …

Arithmetic in finite/Galois fields is a key aspect for many applications such as error correcting
codes and cryptography. Addition and multiplication are two fundamental operations in the …

At present scenario Polynomial basis multipliers are used because they are relatively simple
to design, and offer scalability for the fields of higher orders. It is used in Cryptographic and …

This paper presents the design of a parameterizable n-coefficient polynomial multiplier,
which performs polynomial multiplication in Zp [x]/< xn+ 1>. This multiplier is based on an n …

This paper presents a NTT-based polynomial multiplier for ring-learning with errors (Ring-
LWE) cryptosystem. The polynomial multiplier is a basic and intensive operation of Ring …