Results 201 to 210 of about 126,749 (256)
Some of the next articles are maybe not open access.
High-Speed NTT-based Polynomial Multiplication Accelerator for Post-Quantum Cryptography
IEEE Symposium on Computer Arithmetic, 2021This 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 post-quantum cryptography standardization process. Simultaneously,
Mojtaba Bisheh-Niasar +2 more
semanticscholar +1 more source
An Area-Efficient Large Integer NTT-Multiplier Using Discrete Twiddle Factor Approach
IEEE Transactions on Circuits and Systems - II - Express Briefs, 2023Number theoretic transform (NTT) method shows great advantages in speed and efficiency for applications such as homomorphic encryption. However, the twiddle factor data consumes a lot of memories. In this brief, we propose a novel data compression method,
Zhenmin Li +6 more
semanticscholar +1 more source
Efficient, Error-Resistant NTT Architectures for CRYSTALS-Kyber FPGA Accelerators
IEEE/IFIP International Conference on Very Large Scale Integration of System-on-Chip, 2023The dawn of cost-effective miniaturised satellites is currently attracting venture capital in a never seen before ratio to launch mega-constellations of satellites for a diverse range of applications.
Safiullah Khan +6 more
semanticscholar +1 more source
CKKS-Based Homomorphic Encryption Architecture using Parallel NTT Multiplier
International Symposium on Circuits and Systems, 2023This paper presents a high-throughput CKKS-based encryption architecture for homomorphic encryption. By de-ploying a parallel number theoretic transform (NTT) multiplier architecture, the polynomial multiplication is significantly accel-erated ...
T. Nguyen, Jisu Kim, Hanho Lee
semanticscholar +1 more source
IACR Cryptology ePrint Archive, 2023
Number-Theoretic-Transform (NTT) is a variation of Fast-Fourier-Transform (FFT) on finite fields. NTT is being increasingly used in blockchain and zero-knowledge proof applications.
Kaveh Aasaraai +4 more
semanticscholar +1 more source
Number-Theoretic-Transform (NTT) is a variation of Fast-Fourier-Transform (FFT) on finite fields. NTT is being increasingly used in blockchain and zero-knowledge proof applications.
Kaveh Aasaraai +4 more
semanticscholar +1 more source
Semiconductor Device Simulation at NTT
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985The current status of semiconductor device simulation at NTT is described. Device simulators at NTT are classified into two categories. One is the conventional macroscopic approach and the other is microscopic particle analysis using a Monte Carlo method. In this paper, these simulators are introduced together with the more interesting results. Through
K. Yokoyama +3 more
openaire +1 more source
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2023
Lattice-based cryptography (LBC) schemes are promising candidates in the post-quantum cryptography (PQC) standardization process. Number theoretic transform (NTT), as a crucial technique, is widely used to accelerate LBC implementations on computer ...
Zhaohui Chen, Yuan Ma, Jiwu Jing
semanticscholar +1 more source
Lattice-based cryptography (LBC) schemes are promising candidates in the post-quantum cryptography (PQC) standardization process. Number theoretic transform (NTT), as a crucial technique, is widely used to accelerate LBC implementations on computer ...
Zhaohui Chen, Yuan Ma, Jiwu Jing
semanticscholar +1 more source
An Area-Efficient, Conflict-Free, and Configurable Architecture for Accelerating NTT/INTT
IEEE Transactions on Very Large Scale Integration (VLSI) SystemsThe Number Theoretic Transform (NTT) is a widely adopted method for accelerating polynomial multiplication in lattice-based cryptosystems. Consequently, numerous hardware accelerators have been developed to enhance the speed of the NTT algorithm.
Si-Huang Liu +3 more
semanticscholar +1 more source
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2022
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 homomorphic multiplication, especially the polynomial multiplication which ...
Yang Su +4 more
semanticscholar +1 more source
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 homomorphic multiplication, especially the polynomial multiplication which ...
Yang Su +4 more
semanticscholar +1 more source
Proteus: A Pipelined NTT Architecture Generator
IEEE Transactions on Very Large Scale Integration (VLSI) SystemsNumber theoretic transform (NTT) is a fundamental building block in emerging cryptographic constructions such as fully homomorphic encryption (FHE), post-quantum cryptography (PQC), and zero-knowledge proof (ZKP).
Florian Hirner, A. Mert, Sujoy Sinha Roy
semanticscholar +1 more source

