Results 131 to 140 of about 9,817 (168)

A Novel and Efficient Large Integer Number Theoretic Transform Multiplier Based on Unified Blocks

Latin American Symposium on Circuits and Systems
This work presents a novel integer multiplication architecture based on the Number Theoretic Transform (NTT) for Post Quantum Cryptography. The proposed NTT introduces an overlapping execution of NTT stages, enabling subsequent stages to commence as soon
Shiva Nejati, Moslem Heidarpur, M. Mirhassani   +2 more
semanticscholar   +1 more source

HybridNTT: A Lightweight Learning-Based Dynamic Path Selection Framework for Fast Number Theoretic Transform

Asia Joint Conference on Information Security
Fast and efficient computation of the Number Theoretic Transform (NTT) is essential for accelerating cryptographic algorithms and large integer multiplications.
Gunsang You, Yeontae Ji, H. Youm
semanticscholar   +1 more source

An efficient hardware implementation of number theoretic transform for CRYSTALS-Kyber post-quantum cryptography

Indonesian Journal of Electrical Engineering and Computer Science
CRYSTALS-Kyber was chosen to be the standardized key encapsulation mechanisms (KEMs) out of the finalists in the third round of the National Institute of Standards and Technology (NIST) post-quantum cryptography (PQC) standardization program.
Trang Hoang, Tu Dinh Anh Duong, Thinh Quang Do   +2 more
semanticscholar   +1 more source

HBM-Aware Number Theoretic Transform Accelerator for Zero-Knowledge Proof

ICCD
Zero-Knowledge Proof (ZKP) cryptographic algorithms have garnered significant attention for their ability to enhance privacy. However, the practical deployment of these algorithms remains challenging because they demand extremely high computational ...
Sangwon Shin, Ngoc-Son Pham, Lei Xu, Weidong Shi, Taeweon Suh   +4 more
semanticscholar   +1 more source

Introduction to Number Theoretic Transform

arXiv.org
The Number Theoretic Transform (NTT) can be regarded as a variant of the Discrete Fourier Transform. NTT has been quite a powerful mathematical tool in developing Post-Quantum Cryptography and Homomorphic Encryption.
Banhirup Sengupta, Peenal Gupta, Souvik Sengupta   +2 more
semanticscholar   +1 more source

Efficient Convolution Accelerator Using Number-Theoretic Transform for Deep Learning on Fpga

2025 IEEE 2nd International Conference on Deep Learning and Computer Vision (DLCV)
With the wide application of deep learning technologies in edge computing and IoT devices, low-power and highefficiency convolutional operation acceleration has become a key requirement.
Lingfeng Bai, Rui Zhang, Weidong Zhou, Lan Tian, Guanghao Jin, Guoyang Liu   +5 more
semanticscholar   +1 more source

HiFA: A High-Performance and Flexible Acceleration Framework for Large-Size Number Theoretic Transform

ACM Transactions on Reconfigurable Technology and Systems
Zero-Knowledge Proofs (ZKP) and Homomorphic Encryption (HE) are crucial for data privacy in applications like cloud, blockchain, and analytics. However, the real-world adoption often faces performance challenges, particularly in the execution of the ...
Qilin Hu, Haotian Wang, Chubo Liu, Keqin Li, Kenli Li   +4 more
semanticscholar   +1 more source

A Fully Pipelined FIFO Based Polynomial Multiplication Hardware Architecture Based On Number Theoretic Transform

arXiv.org
This paper presents digital hardware for computing polynomial multiplication using Number Theoretic Transform (NTT), specifically designed for implementation on Field Programmable Gate Arrays (FPGAs).
Moslem Heidarpur, M. Mirhassani, Norman Chang   +2 more
semanticscholar   +1 more source

A Survey on High-Level Synthesis Approaches for Number Theoretic Transform on FPGAs

Midwest Symposium on Circuits and Systems
Number theoretic transform (NTT) is a critical operation in several post-quantum cryptography (PQC) schemes, which enables fast polynomial multiplication.
Wei He, Sunwoong Kim
semanticscholar   +1 more source

Scalable and Parallel Optimization of the Number Theoretic Transform Based on FPGA

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
In lattice-based postquantum cryptography (PQC), polynomial multiplication is complex and time-consuming, which affects the overall computational efficiency.
Bin Li, Yunfei Yan, Yuanxin Wei, Heru Han   +3 more
semanticscholar   +1 more source