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
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
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
NTT and Inverse NTT Quantum Circuits in CRYSTALS-Kyber for Post-Quantum Security Evaluation
The emergence of quantum computers threatens current cryptographic systems, and NIST is preparing for the post-quantum era through the post-quantum cryptography (PQC) contest. CRYSTALS-Kyber is a lattice-based cipher suite that is used as a PQC standard.
Gyeongju Song +4 more
doaj +1 more source
A survey of software implementations for the number theoretic transform
This survey summarizes the software implementation knowledge of the Number Theoretic Transform (NTT)—a major subroutine of lattice-based cryptosystems.
Öztürk, Erdinç +5 more
core +1 more source
Asymmetric Fragile Watermarking Using a Number Theoretic Transform [PDF]
We propose an asymmetric fragile watermarking technique that uses a number theoretic transform (NTT). Signature data is extracted from a watermarked image by determining correlation functions that are computed using the NTT.
Tamori, Hideaki, Yamamoto, Tsuyoshi
core +1 more source
High-Level Synthesis design approach for Number-Theoretic Transform Implementations
Lattice-based cryptography performs polynomial multiplication using the Number Theoretic Transform (NTT), in order to reduce the polynomial multiplication complexity from O(n2) to O(n log n).
Evangelos Haleplidis +4 more
core +1 more source
Area-Time Efficient Hardware Architecture for CRYSTALS-Kyber
This paper presents a novel area-time efficient hardware architecture of the lattice-based CRYSTALS-Kyber, which has entered the third round of the post-quantum cryptography standardization competition hosted by the National Institute of Standards and ...
Tuy Tan Nguyen +3 more
doaj +1 more source
Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography
Lattice-based cryptography has laid the foundation of various modern-day cryptosystems that cater to several applications, including post-quantum cryptography. For structured lattice-based schemes, polynomial arithmetic is a fundamental part. In several
Aikata Aikata +4 more
doaj +1 more source
A Pipelined Hardware Design of FNTT and INTT of CRYSTALS-Kyber PQC Algorithm
Lattice-based post-quantum cryptography (PQC) algorithms demand number theoretic transform (NTT)-based polynomial multiplications. NTT-based polynomials’ multiplication relies on the computation of forward number theoretic transform (FNTT) and inverse ...
Muhammad Rashid +4 more
doaj +1 more source

