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 …

In this paper, we introduce a configurable hardware architecture that can be used to
generate unified and parametric NTT-based polynomial multipliers that support a wide …

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

Thanks to the inherent post-quantum resistant properties, lattice-based cryptography has
gained increasing attention in various cryptographic applications recently. To facilitate the …

Lattice-based cryptography is a powerful cryptographic primitive that can achieve post-
quantum security. The most computational-intensive operations in the lattice-based …

Fully homomorphic encryption (FHE) has experienced significant development and
continuous breakthroughs in theory, enabling its widespread application in various fields …

CRYSTALS-Kyber has emerged as a notable lattice-based post-quantum cryptography
(PQC) scheme. As one of the four finalists in NIST's PQC standardization round three …

Polynomial multiplication is typically employed to establish secured systems, which is
becoming inevitable for many financial and data transaction services. However, the …

Lattice-based cryptography is a cryptographic primitive built upon the hard problems on
point lattices. Cryptosystems relying on lattice-based cryptography have attracted huge …

Data security has always been a concern for digital users. In general, cloud Service
Providers (CSPs) provide security to data during communication, storage, etc., using various …