a lightweight general modular multiplier for kyber pqc

Kyber, a key encapsulation mechanism (kem), plays a pivotal role in post-quantum cryptography. as a finalist in the nist project, kyber is gaining traction in industry libraries and systems. the heart of the kyber algorithm lies in the number theoretic transform (ntt), where modular multiplication is the most intricate operation. in this paper, we propose a novel general modular multiplier that reduces both time and area requirements compared to prior methods. our key innovation lies in the novel reduction algorithm, which avoids fixed values for coefficients a or b (i.e., c = a × b mod q) used in ntt, inverse ntt (intt), and pwm (point-wise multiplication). additionally we introduce two pipeline architectures for modular multiplication within kyber, emphasizing low area usage and high frequency. these architectures demonstrate 8% and 31% better frequency, while our work achieves the lowest slice usage and at (area × time) among all previous work.