Dergi makalesi Açık Erişim

FPGA implementation of a run-time configurable NTT-based polynomial multiplication hardware

2020    Mert, Ahmet Can; Ozturk, Erdinc; Savas, Erkay

Multiplication of polynomials of large degrees is the predominant operation in lattice-based cryptosystems in terms of execution time. This motivates the study of its fast and efficient implementations in hardware. Also, applications such as those using homomorphic encryption need to operate with polynomials of different parameter sets. This calls for design of configurable hardware architectures that can support multiplication of polynomials of various degrees and coefficient sizes.