A secure and scalable blockchain-assisted authentication framework for decentralized IoT data management. [PDF]
Sci RepIswarya G, Vennila C.
europepmc +1 more source
A New Decryption Failure Attack Against HQC
Lecture Notes in Computer Science, 2020 HQC is an IND-CCA2 KEM running for standardization in NIST’s post-quantum cryptography project and has advanced to the second round. It is a code-based scheme in the class of public key encryptions, with given sets of parameters spanning NIST security strength 1, 3 and 5, corresponding to 128, 192 and 256 bits of classic security.
Qian Guo +2 more
exaly +4 more sources
Decryption Failure Is More Likely After Success [PDF]
Lecture Notes in Computer Science, 2020 The user of an imperfectly correct lattice-based public-key encryption scheme leaks information about their secret key with each decryption query that they answer—even if they answer all queries successfully. Through a refinement of the D’Anvers–Guo–Johansson–Nilsson–Vercauteren–Verbauwhede failure boosting attack, we show that an adversary can use ...
Nina Bindel, John M. Schanck
exaly +4 more sources
Exploring Decryption Failures of BIKE: New Class of Weak Keys and Key Recovery Attacks [PDF]
Lecture Notes in Computer Science, 2023 Code-based cryptography has received a lot of attention recently because it is considered secure under quantum computing. Among them, the QC-MDPC based scheme is one of the most promising due to its excellent performance.
Xiaoyun Wang, Wang Anyu
exaly +4 more sources
The Influence of LWE/RLWE Parameters on the Stochastic Dependence of Decryption Failures [PDF]
, 2020 Learning with Errors (LWE) and Ring-LWE (RLWE) problems allow the construction of efficient key exchange and public-key encryption schemes. However, while improving the security through the use of error distributions with large standard deviations, the decryption failure rate increases as well.
Georg Maringer +2 more
openaire +3 more sources
NTRU Binary Polynomials Parameters Selection for Reduction of Decryption Failure
, 2016 This paper studies the NTRU public key cryptosystem to identify the most influential parameters for decryption failure confirming that decryption failure is key-dependent. The study uses binary polynomials and analyzes the correlation between the parameter sets recommended in the EESS 1v2 (2003) and Jeffrey Hoffstein et al. (2003).
Juliet N. Gaithuru +3 more
openaire +2 more sources
Efficient methods to overcome Rabin cryptosystem decryption failure [PDF]
, 2017 Summary: Rabin cryptosystem is an efficient factoring-based scheme, however, its decryption produces 4-to-1 output, which leads to decryption failure. In this work, in order to overcome the 4-to-1 decryption problem for the Rabin cryptosystem, we propose two distinct methods using the modulus of the type \(N=p^2q\) coupled with the restriction on the ...
Mahad, Zahari +2 more
openaire +2 more sources
Related searches:
Multitarget Decryption Failure Attacks and Their Application to Saber and Kyber
Lecture Notes in Computer Science, 2022Jan-Pieter D'Anvers
exaly +3 more sources
Tight Analysis of Decryption Failure Probability of Kyber in Reality
Lecture Notes in Computer Science, 2022Weize Wang, Yunlei Zhao, Zhao Yunlei
exaly +3 more sources
Provable Security Against Decryption Failure Attacks from LWE [PDF]
In a recent work, Hövelmanns, Hülsing and Majenz introduced a new security proof for the Fujisaki-Okamoto transform in the quantum-accessible random oracle model (QROM) used in post-quantum key encapsulation mechanisms.
Christian Majenz, Fabrizio Sisinni
core +4 more sources