This paper demonstrates an architecture for accelerating the polynomial multiplication using
number theoretic transform (NTT). Kyber is one of the finalists in the third round of the NIST …

Large scale quantum computers will break classical public-key cryptography protocols by
quantum algorithms such as Shor's algorithm. Hence, designing quantum-safe …

Side-channel attacks can break mathematically secure cryptographic systems leading to a
major concern in applied cryptography. While the cryptanalysis and security evaluation of …

Polynomial multiplication is one of the most time-consuming operations utilized in lattice-
based post-quantum cryptography (PQC) schemes. CRYSTALS-KYBER is a lattice-based …

Fully Homomorphic Encryption over the Torus (TFHE) allows arbitrary computations to
happen directly on ciphertexts using homomorphic logic gates. However, each TFHE gate …

Polynomial multiplication is the key and time-consuming operation among various operators
in Post-Quantum Cryptography (PQC), which aims to find quantum-resistant algorithms to …

As the computation bottleneck in lattice-based cryptography (LBC), the polynomial
multiplication based on number theoretic transform (NTT) has been continuously studied for …

Number theoretic transform (NTT) is useful for the acceleration of polynomial multiplication,
which is the main performance bottleneck in the next-generation cryptographic schemes …

The ring learning with error (RLWE)-based fully homomorphic encryption (FHE) scheme has
become one of the most promising FHE schemes. However, its performance is limited by the …

Recently, the National Institute of Standards and Technology (NIST) has identified the first
four quantum-resistant algorithms for post-quantum cryptography (PQC) standardization …