Results 1 to 10 of about 1,896 (262)
A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
HeliyonIn 1999, the Polynomial Reconstruction Problem (PRP) was put forward as a new hard mathematics problem. A univariate PRP scheme by Augot and Finiasz was introduced at Eurocrypt in 2003, and this cryptosystem was fully cryptanalyzed in 2004.
Siti Nabilah Yusof +6 more
doaj +8 more sources
Decryption Failure Attacks on IND-CCA Secure Lattice-Based Schemes
Lecture Notes in Computer Science, 2019 In this paper we investigate the impact of decryption failures on the chosen-ciphertext security of lattice-based primitives. We discuss a generic framework for secret key recovery based on decryption failures and present an attack on the NIST Post-Quantum Proposal ss-ntru-pke.
Jan-Pieter D'Anvers +2 more
exaly +5 more sources
On Accuracy of Testing Decryption Failure Rate for Encryption Schemes under the LWE Assumption
IET Information SecurityLattice-based encryption schemes are significant cryptographic primitives to defend information security against quantum menace, and the decryption failure rate is related to both theoretical and realistic security.
Lin Wang, Yang Wang, Huiwen Jia
doaj +3 more sources
Analysis on Aigis‐Enc: Asymmetrical and symmetrical [PDF]
IET Information Security, 2021 Aigis‐Enc is an encryption algorithm based on asymmetrical learning with errors (LWE). A thorough comparison between Aigis‐Enc (with the recommended parameters) and a symmetrical LWE encryption scheme on the same scale (the sampling parameters are {η1 ...
Yupu Hu, Siyue Dong, Xingting Dong
doaj +2 more sources
Enhanced NTRU cryptosystem eliminating decryption failures
Journal of Systems Engineering and Electronics, 2006 Summary: An enhaned NTRU cryptosystem eliminating decryption failures is proposed without using padding schemes and can resist the oracle model and chosen-ciphertext attacks. Because lattice reduction is the main threat to lattice-based cryptosystems, lattice reduction algorithms are analyzed to evaluate the security of this scheme.
Zeng Guihua
exaly +2 more sources
IEEE AccessFormal correctness proofs, analytical tail bounds, and empirical failure studies provide strong guarantees for the Module-Lattice-Based Key-Encapsulation Mechanism (ML–KEM).
Eliseo Sarmiento Rosales +1 more
doaj +2 more sources
Machine Learning: Science and TechnologyWe present a probabilistic modeling framework for quantifying decryption-failure probability (DFP) in CRYSTALS–Kyber , the lattice-based key encapsulation mechanism standardized by National Institute of Standards and Technology as module-lattice-based ...
Cemil Emre Yavas +2 more
doaj +2 more sources
Distributed Attribute-Based Encryption Scheme Based on Fog Nodes [PDF]
Jisuanji gongcheng, 2021 The existing cloud storage schemes have multiple limitations, including the general division of user rights to access data, fine-grained control access permissions, and single point of failure in single authority.This paper proposes a distributed ...
MA Jiajia, ZHANG Zhiqiang, CAO Suzhen, DOU Fengge, DING Xiaohui, WANG Caifen
doaj +1 more source
HybridPKE: A forward-secure non-interactive quantum-safe hybrid key exchange scheme
Engineering Science and Technology, an International Journal, 2022 The schemes submitted to NIST call for standardization of post-quantum cryptography have some common drawbacks in terms of decryption failure probability, scalability, and switching issues from pre-quantum to post- quantum cryptography. In this paper, we
Simran Choudhary, Anil Gupta
doaj +1 more source
CQTRU: A Commutative Quaternions Rings Based Public Key Cryptosystem [PDF]
Engineering and Technology Journal, 2016 In this paper, we propose a new version of the NTRU public key cryptosystem called CQTRU. It is a four-dimensional cryptosystem based on the commutative quaternion ring.
Nadia M.G. Alsaidi +2 more
doaj +1 more source