Keshab K. Parhi

Reduced-Complexity Modular Polynomial Multiplication for R-LWE Cryptosystems

2021

The ring-learning with errors (R-LWR) problem is utilized to build many ciphers resisting quantum-computing attacks and fully homomorphic encryption that allows computations to be carried out on encrypted data. Modular multiplication of long polynomials with …

Integral Sampler and Polynomial Multiplication Architecture for Lattice-based Cryptography

2022

With the surge of the powerful quantum computer, lattice-based cryptography proliferated the latest cryptography hardware implementation due to its resistance against quantum computers. Among the computational blocks of lattice-based cryptography, the random errors produced by …