Results 141 to 150 of about 9,817 (168)
Some of the next articles are maybe not open access.

A 28 nm 75.6 KOPS 13 nJ Computing-in-Memory Pipeline Number Theoretic Transform Accelerator for PQC

IEEE Transactions on Circuits and Systems - II - Express Briefs
Lattice-based cryptography (LBC) exploits the learning with errors (LWE) problem and is the main algorithm standardized for Post-Quantum Cryptography (PQC).
Jialiang Zhu   +8 more
semanticscholar   +1 more source

NTTSuite: Number Theoretic Transform Benchmarks for Accelerating Encrypted Computation

arXiv.org
Privacy concerns have thrust privacy-preserving computation into the spotlight. Homomorphic encryption (HE) is a cryptographic system that enables computation to occur directly on encrypted data, providing users with strong privacy (and security ...
Juran Ding   +3 more
semanticscholar   +1 more source

Fully Pipelined Number Theoretic Transform and Reordering Solution for CRYSTALS-Dilithium

Information and Communication Technologies and Accessibility
This study presents a fully pipelined hardware architecture for the Number Theoretic Transform (NTT) and its inverse (INTT) in the CRYSTALS-Dilithium Post-Quantum Cryptography(PQC) signature algorithm, ensuring an uninterrupted processing flow.
Pengfei Sun, Makoto Ikeda
semanticscholar   +1 more source

A Study on Number Theoretic Transform Acceleration on AMD AI Engine

International Symposium on Embedded Multicore/Many-core Systems-on-Chip
Number Theoretic Transform (NTT), a variant of Fast Fourier Tranform operating on a finite field, is a crucial building block in lattice-based cryptography, such as CRYSTALS-Kyber and Homomorphic Encryption.
Ai Nozaki   +3 more
semanticscholar   +1 more source

GS-MDC: High-Speed and Area-Efficient Number Theoretic Transform Design

IEEE Transactions on Circuits and Systems - II - Express Briefs
Homomorphic encryption (HE) has recently become a promising approach to guarantee the privacy security in cloud computing. Number theoretic transform (NTT) can be used to accelerate the polynomial multiplication in HE, but is usually considered the ...
Yue Geng, Xiao Hu, Zhongfeng Wang
semanticscholar   +1 more source

Low-Complexity and High-Throughput Number Theoretic Transform Architecture for Polynomial Multiplication in Homomorphic Encryption

International Symposium on Circuits and Systems
The computationally intensive of polynomial ring multiplication in homomorphic encryption (HE) schemes demand an optimized hardware accelerator design, specifically targeted for edge devices. The state-of-the-art algorithm for calculating polynomial ring
Nana Sutisna   +5 more
semanticscholar   +1 more source

PhotonNTT: Energy-Efficient Parallel Photonic Number Theoretic Transform Accelerator

Design, Automation and Test in Europe
Fully homomorphic encryption (FHE) presents a promising opportunity to remove privacy barriers in various scenarios including cloud computing and secure database search, by enabling computation on encrypted data.
Xianbin Li   +10 more
semanticscholar   +1 more source

Cancer treatment and survivorship statistics, 2022

Ca-A Cancer Journal for Clinicians, 2022
Kimberly D Miller   +2 more
exaly  

Proportion and number of cancer cases and deaths attributable to potentially modifiable risk factors in the United States

Ca-A Cancer Journal for Clinicians, 2018
Farhad Islami   +2 more
exaly  

Cancer statistics in China, 2015

Ca-A Cancer Journal for Clinicians, 2016
Rongshou Zheng   +2 more
exaly  

Home - About - Disclaimer - Privacy