Decryption Failure Is More Likely After Success

DOI10.1007/978-3-030-44223-1_12zbMath1501.94028OpenAlexW3003329346MaRDI QIDQ5041221

Nina Bindel, John M. Schanck

Publication date: 13 October 2022

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-44223-1_12

zbMATH Keywords

public-key cryptographylattice-based cryptographydecryption failure

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (7)

More accurate geometric analysis on the impact of successful decryptions for IND-CCA secure Ring/Mod-LWE/LWR based schemes ⋮ Multitarget Decryption Failure Attacks and Their Application to Saber and Kyber ⋮ Efficient computation of tight approximations to Chernoff bounds ⋮ Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks ⋮ Failing gracefully: decryption failures and the Fujisaki-Okamoto transform ⋮ Revisiting security estimation for LWE with hints from a geometric perspective ⋮ CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors

Uses Software

• Backflip

Cites Work

• A modular analysis of the Fujisaki-Okamoto transformation
• Secure integration of asymmetric and symmetric encryption schemes
• On constant-time QC-MDPC decoders with negligible failure rate
• Decryption failure attacks on IND-CCA secure lattice-based schemes
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Trapdoors for hard lattices and new cryptographic constructions
• New directions in nearest neighbor searching with applications to lattice sieving
• Secure integration of asymmetric and symmetric encryption schemes
• Cryptography and Coding
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Decryption Failure Is More Likely After Success