Results 1 to 10 of about 9,804,797 (165)
RM-NTT: An RRAM-Based Compute-in-Memory Number Theoretic Transform Accelerator
As more cloud computing resources are used for machine learning training and inference processes, privacy-preserving techniques that protect data from revealing at the cloud platforms attract increasing interest. Homomorphic encryption (HE) is one of the
Yongmo Park +3 more
doaj +4 more sources
Area-time efficient pipelined number theoretic transform for CRYSTALS-Kyber. [PDF]
CRYSTALS-Kyber has been standardized by the National Institute of Standards and Technology (NIST) as a quantum-resistant algorithm in the post-quantum cryptography (PQC) competition. The bottleneck in performance of Kyber is the polynomial multiplication
Ayesha Waris +2 more
doaj +2 more sources
Pipelined and conflict-free number theoretic transform accelerator for CRYSTALS-Kyber on FPGA. [PDF]
Post-quantum cryptographic (PQC) algorithms are essential due to the threat posed by quantum computers to the security of currently deployed cryptosystems.
Ayesha Waris +2 more
doaj +2 more sources
Conceptual Review on Number Theoretic Transform and Comprehensive Review on Its Implementations
The Number Theoretic Transform (NTT) is a powerful mathematical tool that has become increasingly important in developing Post Quantum Cryptography (PQC) and Homomorphic Encryption (HE).
Ardianto Satriawan +5 more
doaj +1 more source
Number-Theoretic Transform with Constant Time Computation for Embedded Post-Quantum Cryptography
In this article, we describe the principles and advantages of using the Number-Theoretic Transform (NTT) in post-quantum cryptography. We deal with usages of NTT in post-quantum algorithms included in the competition announced by the National Institute ...
Kupcová Eva, Drutarovský Miloš
doaj +1 more source
Number theoretic transform (NTT) is widely utilized to speed up polynomial multiplication, which is the critical computation bottleneck in a lot of cryptographic algorithms like lattice-based post-quantum cryptography (PQC) and homomorphic encryption (HE)
Xiangren Chen +4 more
doaj +1 more source
Highly Efficient Architecture of NewHope-NIST on FPGA using Low-Complexity NTT/INTT
NewHope-NIST is a promising ring learning with errors (RLWE)-based postquantum cryptography (PQC) for key encapsulation mechanisms. The performance on the field-programmable gate array (FPGA) affects the applicability of NewHope-NIST.
Neng Zhang +5 more
doaj +1 more source
Faster Bootstrapping via Modulus Raising and Composite NTT
FHEW-like schemes utilize exact gadget decomposition to reduce error growth and ensure that the bootstrapping incurs only polynomial error growth. However, the exact gadget decomposition method requires higher computation complexity and larger memory ...
Zhihao Li +6 more
doaj +1 more source
NTT Multiplication for NTT-unfriendly Rings
In this paper, we show how multiplication for polynomial rings used in the NIST PQC finalists Saber and NTRU can be efficiently implemented using the Number-theoretic transform (NTT).
Chi-Ming Marvin Chung +5 more
doaj +1 more source
Configurable Mixed-Radix Number Theoretic Transform Architecture for Lattice-Based Cryptography
Lattice-based cryptography continues to dominate in the second-round finalists of the National Institute of Standards and Technology post-quantum cryptography standardization process. Computational efficiency is primarily considered to evaluate promising
Phap Duong-Ngoc, Hanho Lee
doaj +1 more source

