Results 61 to 70 of about 393,601 (145)
Revisiting LWR: A Novel Reduction Through Quantum Approximations
Pseudorandom functions (PRFs) are a very important tool in cryptography, and the learning with rounding (LWR) problem is one of the main issues in their construction. LWR problem, is to find s∈Zqn from ⌊As⌋p, where A∈Zqm×n and ⋅p:Zq→Zp is the rounding function.
Zhuang Shan +3 more
wiley +1 more source
Improved FHE Bootstrapping and Its Applications in Discretized Neural Networks
The inefficiency of bootstrapping is the primary bottleneck preventing fully homomorphic encryption (FHE) from practical applications. One of the main obstacles to improving the bootstrapping performance using hardware acceleration is the large storage overhead of the bootstrapping keys.
Kaixing Wang +5 more
wiley +1 more source
The current multikey fully homomorphic encryption (MKFHE) needs to add exponential noise in the distributed decryption phase to ensure the simulatability of partial decryption. Such a large noise causes the ciphertext modulus of the scheme to increase exponentially compared to the single‐key fully homomorphic encryption (FHE), further reducing the ...
Xiaokang Dai +3 more
wiley +1 more source
Post‐Quantum Digital Signatures for Enhanced Medical Image Security
This study explores the use of Sphincs+, Dilithium, and Falcon to enhance the security of medical images against quantum threats. By leveraging digital signatures for authentication and integrity verification, the proposed approach mitigates risks of tampering and ensures the reliability of healthcare records.
Kumar Sekhar Roy +5 more
wiley +1 more source
Optimized Design and Implementation of CRYSTALS‐KYBER Based on MLWE
CRYSTALS‐KYBER is a postquantum key exchange mechanism based on the MLWE problem. At present, it is a major challenge to realize CRYSTALS‐KYBER with high‐performance and low‐resource consumption on the FPGA platform. The design proposed in this paper aims at the high efficiency implementation of CRYSTALS‐KYBER based on the MLWE scheme.
Song Cheng +7 more
wiley +1 more source
A variant of NTRU with non-invertible polynomials
. We introduce a generalization of the NTRU cryptosystem and describe its advantages and disadvantages as compared with the original NTRU protocol. This extension helps to avoid the potential problem of finding “enough ” invertible polynomials within ...
Igor E. Shparlinski, William D. Banks
core +1 more source
Quantum blockchain: Trends, technologies, and future directions
This article surveys the current state of blockchain technology, emphasising its security, authentication protocols, AI integration, and the emerging field of quantum blockchain. It highlights how quantum computing can enhance blockchain security and the necessity for quantum‐resistant designs to ensure the robustness of blockchain networks against ...
Manjula Gandhi S +15 more
wiley +1 more source
QIoTChain: Quantum IoT‐blockchain fusion for advanced data protection in Industry 4.0
Data underpins modern society and the economy, enabling informed choices and innovation. Protecting data from tampering is crucial, leading to encryption using cryptography, blockchain, and zero trust models. Quantum computing advances aid post‐quantum security, yet adoption hurdles persist.
Aditya Kumar Sharma +3 more
wiley +1 more source
Indistinguishability under adaptive chosen-ciphertext attack secure double-NTRU-based key encapsulation mechanism. [PDF]
Seyhan K, Akleylek S.
europepmc +1 more source
Comparison between Subfield and Straightforward Attacks on NTRU [PDF]
Recently in two independent papers, Albrecht, Bai and Ducas and Cheon, Jeong and Lee presented two very similar attacks, that allow to break NTRU with larger parameters and GGH Multinear Map without zero encodings.
Pierre-Alain Fouque, Paul Kirchner
core +1 more source

