Decryption failure - Open Access .click

Third International Conference on Information Technology and Applications (ICITA'05), 2005
NTRU is a new public key encryption scheme based on hard problems in lattice. Due to the linear operations, both encryption and decryption of NTRU are very fast. However, decryption of this scheme may be failed even for recommended parameters. In this paper, NTRU decryption failures are analyzed.
null Weichi Yu, D. He, null Shixiong Zhu
openaire +1 more source

A New Decryption Failure Attack Against HQC

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, Thomas Johansson
openaire +1 more source

Decryption Failure Is More Likely After Success

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
openaire +1 more source

The Influence of LWE/RLWE Parameters on the Stochastic Dependence of Decryption Failures

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, Tim Fritzmann, Johanna Sepúlveda +2 more
openaire +1 more source

post-quantum cryptography
blockchain
lattice-based cryptography

cryptography
kyber
side-channel attack

key encapsulation mechanism
decryption failure rate
computer science