Results 121 to 130 of about 9,817 (168)
IEEE Transactions on Very Large Scale Integration (VLSI) SystemsZeming Cheng +3 more
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Efficient Number Theoretic Transform Architecture for CRYSTALS-Kyber
IEEE Transactions on Circuits and Systems - II - Express BriefsThe Number Theoretic Transform (NTT) is a central primitive to compute polynomial multiplication in a finite ring for both post-quantum cryptography (PQC) and fully homomorphic encryption (FHE) schemes. This brief presents a novel, efficient NTT hardware
Khalid Javeed, David Gregg
semanticscholar +1 more source
Hybrid Number Theoretic Transform Architecture for Homomorphic Encryption
IEEE Transactions on Very Large Scale Integration (VLSI) SystemsFully homomorphic encryption (FHE) is an innovative cryptographic technology that has the potential to protect the privacy and confidentiality of data in the untrusted environments, such as public clouds or external parties. However, due to the inclusion
Quang Dang Truong +2 more
semanticscholar +1 more source
Extended Number Theoretic Transform for Lightweight Post-Quantum Cryptosystems in IoT
IEEE Internet of Things JournalThe primary computational complexity of the lattice-based post-quantum cryptosystems (PQCs), aside from hashing, comes from the polynomial multiplication.
Hyeong-Gun Joo +2 more
semanticscholar +1 more source
Accelerating Number Theoretic Transform with Multi-GPU Systems for Efficient Zero Knowledge Proof
International Conference on Architectural Support for Programming Languages and Operating SystemsZero-knowledge proofs validate statements without revealing any information, pivotal for applications such as verifiable outsourcing and digital currencies.
Zhuoran Ji +4 more
semanticscholar +1 more source
2025 International Conference on Advanced Computing Technologies (ICoACT)
This research paper aims to improve the applications that need fast polynomial multiplication, particularly errors-correcting codes and encryption, where the Number Theoretic Transform (NTT) is an essential tool.
Chetan Harsha Lekkala +3 more
semanticscholar +1 more source
This research paper aims to improve the applications that need fast polynomial multiplication, particularly errors-correcting codes and encryption, where the Number Theoretic Transform (NTT) is an essential tool.
Chetan Harsha Lekkala +3 more
semanticscholar +1 more source
MBSNTT: A Highly Parallel Digital In-Memory Bit-Serial Number Theoretic Transform Accelerator
IEEE Transactions on Very Large Scale Integration (VLSI) SystemsConventional cryptographic systems protect the data security during communication but give third-party cloud operators complete access to compute decrypted user data.
A. Pakala, Zhiyu Chen, Kaiyuan Yang
semanticscholar +1 more source
IEEE Symposium on Field-Programmable Custom Computing Machines
Fully Homomorphic Encryption (FHE), which enables homomorphic computing on encrypted data, has emerged as a promising privacy-aware computing method. However, FHE is orders-of-magnitude slower than the same computation on plain data, making it far from ...
Dilshan Kumarathunga +2 more
semanticscholar +1 more source
Fully Homomorphic Encryption (FHE), which enables homomorphic computing on encrypted data, has emerged as a promising privacy-aware computing method. However, FHE is orders-of-magnitude slower than the same computation on plain data, making it far from ...
Dilshan Kumarathunga +2 more
semanticscholar +1 more source
A Unified Hardware Accelerator for Fast Fourier Transform and Number Theoretic Transform
IEEE International Conference on Acoustics, Speech, and Signal ProcessingThe Number Theoretic Transform (NTT) is an indispensable tool for computing efficient polynomial multiplications in post-quantum lattice-based cryptography.
Rishabh Shrivastava +3 more
semanticscholar +1 more source
An Efficient Number Theoretic Transform Implementation for FIPS-203 on FPGA
International Symposium on Circuits and SystemsThe Number Theoretic Transform (NTT) is a key component in modern Post-Quantum Cryptography (PQC) systems, known for its efficient polynomial multiplication capabilities.
S. Elewa, E. Tawfik
semanticscholar +1 more source