IEEE

Division-Free Four-Way Toom–Cook Polynomial Multiplication Architecture for Large Integer Arithmetic on FPGAs and ASICs

Abstract: Polynomial multiplication performs as the most important task and is computationally extensive in cryptographic algorithms. Of the several polynomial multiplications, theoretically, the Toom ...
IEEE

High-Speed VLSI Architectures for Modular Polynomial Multiplication via Fast Filtering and Applications to Lattice-Based Cryptography

Abstract: This paper presents a low-latency hardware accelerator for modular polynomial multiplication for lattice-based post-quantum cryptography and homomorphic encryption applications. The proposed ...