Results 51 to 60 of about 2,451 (171)
A Flexible NTT-Based Multiplier for Post-Quantum Cryptography
IEEE Access, 2023 In this work an NTT-based (Number Theoretic Transform) multiplier for code-based Post-Quantum Cryptography (PQC) is presented, supporting Quasi Cyclic Low/Moderate-Density Parity-Check (QC LDPC/MDPC) codes.
Kristjane Koleci +3 more
doaj +1 more source
SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers [PDF]
, 2015 Homomorphic encryption (HE) systems enable computations on encrypted data, without decrypting and without knowledge of the secret key. In this work, we describe an optimized Ring Learning With Errors (RLWE) based implementation of a variant of the HE ...
Gulak, Glenn +2 more
core +2 more sources
Agribusiness, Volume 42, Issue 2, Page 845-861, Spring 2026.ABSTRACT The Mekong Delta (MKD), Vietnam has achieved high rice productivity through rapid intensification. However, this progress has led to environmental degradation and adverse economic and health effects. To mitigate these challenges, sustainable agricultural practices (SAPs) have been promoted.
Nguyen Thi Thu Hien +5 more
wiley +1 more source
Transactions on Cryptographic Hardware and Embedded SystemsNumber Theoretic Transform (NTT) has been widely used in accelerating computations in lattice-based cryptography. However, attackers can potentially launch power analysis targeting the NTT because it is one of the most time-consuming parts of the ...
Tianrun Yu +5 more
doaj +1 more source
Area-Efficient Polynomial Multiplication Hardware Implementation for Lattice-based Cryptography [PDF]
Jisuanji gongchengLattice-based post-quantum cryptography algorithms demonstrate significant potential in public-key cryptography. A key performance bottleneck in hardware implementation is the computational complexity of polynomial multiplication. To address the problems
XIE Jiaxing, PU Jinwei, FANG Weitian, ZHENG Xin, XIONG Xiaoming
doaj +1 more source
Masked Accelerators and Instruction Set Extensions for Post-Quantum Cryptography
Transactions on Cryptographic Hardware and Embedded Systems, 2021 Side-channel attacks can break mathematically secure cryptographic systems leading to a major concern in applied cryptography. While the cryptanalysis and security evaluation of Post-Quantum Cryptography (PQC) have already received an increasing research
Tim Fritzmann +6 more
doaj +1 more source
The Epistemic Significance of Valid Inference – A Model-Theoretic Approach [PDF]
, 2015 The problem analysed in this paper is whether we can gain knowledge by using valid inferences, and how we can explain this process from a model-theoretic perspective.
Brîncuș, Constantin C.
core
Simple Encrypted Arithmetic Library - SEAL v2.1 [PDF]
, 2017 Achieving fully homomorphic encryption was a longstanding open problem in cryptography until it was resolved by Gentry in 2009. Soon after, several homomorphic encryption schemes were proposed.
Chen, Hao, Laine, Kim, Player, Rachel
core +2 more sources
Multiple front and pulse solutions in spatially periodic systems
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract In this paper, we develop a comprehensive mathematical toolbox for the construction and spectral stability analysis of stationary multiple front and pulse solutions to general semilinear evolution problems on the real line with spatially periodic coefficients.
Lukas Bengel, Björn de Rijk
wiley +1 more source
HF-NTT: Hazard-Free Dataflow Accelerator for Number Theoretic Transform
Polynomial multiplication is one of the fundamental operations in many applications, such as fully homomorphic encryption (FHE). However, the computational inefficiency stemming from polynomials with many large-bit coefficients poses a significant challenge for the practical implementation of FHE.
Meng, Xiangchen +2 more
openaire +2 more sources