A Reconfigurable and Efficient Architecture for Modular Polynomial Multiplier in Post-Quantum Cryptography

Quantum-resistant cryptographic algorithms have been proposed to prevent the security attacks from future Quantum Computers. The modular polynomial multiplication is the frequent and time-consuming arithmetic operation in Lattice Based Quantum-resistant Cryptography. In this paper, an efficient and reconfigurable architecture for modular polynomial multiplier is proposed in Lattice Based PostQuantum Cryptography which can be implemented serially or parallelly depending on the application environments. The proposed modular polynomial multiplier is easily embedded in a crypto-processor to provide security services in the time of Quantum Computing.