Results 1 to 10 of about 5,753 (265)

FPGA multi-unit parallel optimization and implementation of post-quantum cryptography CRYSTALS-Kyber

Tongxin xuebao, 2022
In lattice-based post-quantum cryptography, polynomial multiplication is complicated and time-consuming.In order to improve the computational efficiency of lattice cryptography in practical applications, an FPGA multi-unit parallel optimization and ...
Bin LI, Xiaojie CHEN, Feng FENG, Qinglei ZHOU   +3 more
doaj  

Efficient and Low-Cost Modular Polynomial Multiplier for WSN Security

Journal of Sensor and Actuator Networks
Wireless Sensor Network (WSN) technology has constrained computing resources that require efficient and low-cost cryptographic hardware to provide security services, particularly when dealing with large modular polynomial multiplication in cryptography ...
Fariha Haroon, Hua Li
doaj   +1 more source

High-Efficiency Multi-Standard Polynomial Multiplication Accelerator on RISC-V SoC for Post-Quantum Cryptography

IEEE Access
Number Theoretic Transform (NTT) enables speeding up polynomial multiplications, thereby accelerating the implementation of lattice-based post-quantum cryptography (PQC) algorithms.
Duc-Thuan Dam, Trong-Hung Nguyen, Thai-Ha Tran, Duc-Hung Le, Trong-Thuc Hoang, Cong-Kha Pham   +5 more
doaj   +1 more source

CRYPHTOR: A Memory-Unified NTT-Based Hardware Accelerator for Post-Quantum CRYSTALS Algorithms

IEEE Access
This paper presents the design and FPGA implementation of a hardware accelerator for the Post-Quantum CRYSTALS-Kyber and CRYSTALS-Dilithium algorithms, named CRYPHTOR (CRYstals Polynomial HW acceleraTOR).
Stefano Di Matteo, Ivan Sarno, Sergio Saponara   +2 more
doaj   +1 more source

GPU-oriented implementation and optimization of Karatsuba–NTT polynomial multiplication

Journal of King Saud University: Computer and Information Sciences
Polynomial multiplication serves as a fundamental computational primitive in modern cryptography–including fully homomorphic encryption and zero-knowledge proofs –as well as in digital signal processing.
Ruwei Huang, Xiaolong Tang, Junjie Wang, Xuezheng Qin   +3 more
doaj   +1 more source

Parallel Accelerating Number Theoretic Transform for Bootstrapping on a Graphics Processing Unit

Mathematics
The bootstrapping procedure has become the main bottleneck affecting the efficiency of all known fully homomorphic encryption (FHE) schemes. The state-of-the-art scheme for efficient bootstrapping, which is called fully homomorphic encryption over the ...
Huixian Li, Deng Pan, Jinglei Li, Hao Wang   +3 more
doaj   +1 more source

Accelerating homomorphic ReLU via segmented lookup table and dynamic CG-NTT reuse

网络与信息安全学报
Fully homomorphic encryption does not support nonlinear homomorphic computation, making it difficult to directly implement homomorphic ReLU evaluation in privacy-preserving machine learning.
Liao Yinglong, Luo Yuqiao, Li Danjie, Li Lingwu, Yao Lei, Jiang Lin, Fang Junbin   +6 more
doaj  

Better Circuits for Binary Polynomial Multiplication. [PDF]

IEEE Trans Comput, 2019
Find MG, Peralta R.
europepmc   +1 more source

A Radix-2/4/8-Based Pipelined NTT/INTT Architecture for Homomorphic Encryption

IEEE Access
Homomorphic encryption (HE) is a cryptographic scheme that enables data to be stored, transmitted, and processed in encrypted form, making it an effective solution for data-sensitive applications such as defense and healthcare.
Ju-Hyung Lee, Young-Chan Jang, Kyung-Wook Shin   +2 more
doaj   +1 more source

Efficient Serial Systolic Polynomial Multiplier for Lattice-Based Post-Quantum Cryptographic Schemes in IoT Edge Node

Network
The rapid development of the Internet of Things (IoT) is transforming various economic and industrial sectors by embedding interconnected devices within their operational processes. However, security and privacy risks associated with these interconnected
Atef Ibrahim, Fayez Gebali
doaj   +1 more source