NTT architecture for a Linux-ready RISC-V fully-homomorphic encryption accelerator
This paper proposes two architectures for the acceleration of Number Theoretic Transforms
(NTTs) using a novel Montgomery-based butterfly. We first design a custom NTT hardware …
(NTTs) using a novel Montgomery-based butterfly. We first design a custom NTT hardware …
HPKA: A high-performance CRYSTALS-Kyber accelerator exploring efficient pipelining
CRYSTALS-Kyber (Kyber) was recently chosen as the first quantum resistant Key
Encapsulation Mechanism (KEM) scheme for standardisation, after three rounds of the …
Encapsulation Mechanism (KEM) scheme for standardisation, after three rounds of the …
AC-PM: An area-efficient and configurable polynomial multiplier for lattice based cryptography
As the computation bottleneck in lattice-based cryptography (LBC), the polynomial
multiplication based on number theoretic transform (NTT) has been continuously studied for …
multiplication based on number theoretic transform (NTT) has been continuously studied for …
FPGA accelerated post-quantum cryptography
Recent advancement in quantum information processing technology has led to the
emergence of advanced cryptography in the post-quantum era. Next generation …
emergence of advanced cryptography in the post-quantum era. Next generation …
PaReNTT: Low-latency parallel residue number system and NTT-based long polynomial modular multiplication for homomorphic encryption
High-speed long polynomial multiplication is important for applications in homomorphic
encryption (HE) and lattice-based cryptosystems. This paper addresses low-latency …
encryption (HE) and lattice-based cryptosystems. This paper addresses low-latency …
KaratSaber: New speed records for saber polynomial multiplication using efficient Karatsuba FPGA architecture
SABER is a round 3 candidate in the NIST Post-Quantum Cryptography Standardization
process. Polynomial convolution is one of the most computationally intensive operation in …
process. Polynomial convolution is one of the most computationally intensive operation in …
Pipelined high-throughput NTT architecture for lattice-based cryptography
Lattice-based cryptography is a powerful cryptographic primitive that can achieve post-
quantum security. The most computational-intensive operations in the lattice-based …
quantum security. The most computational-intensive operations in the lattice-based …
[HTML][HTML] A low-cost high-speed radix-4 Montgomery modular multiplier without carry-propagate format conversion
SR Kuang, CY Wang, YJ Chen - Engineering Science and Technology, an …, 2024 - Elsevier
Modular multiplication is the most critical and time-consuming operation in numerous public-
key cryptosystems used to establish secure networks. Especially in Internet of Things (IoT) …
key cryptosystems used to establish secure networks. Especially in Internet of Things (IoT) …
FPGA Implementation of robust and Secure Transmission Cryptosystem for Satellite Images
In today's interconnected world, with the changes caused by the technological revolution
conflicts, politics, diseases and climate changes, along with the growing influence of artificial …
conflicts, politics, diseases and climate changes, along with the growing influence of artificial …
DARM: A low-complexity and fast modular multiplier for lattice-based cryptography
The lattice-based cryptography (LBC) has been widely used recently in many compute-
intensive applications, such as the post-quantum cryptography (PQC) and privacy …
intensive applications, such as the post-quantum cryptography (PQC) and privacy …