LWE with side information: attacks and concrete security estimation

DOI10.1007/978-3-030-56880-1_12zbMath1504.94128OpenAlexW3013288840MaRDI QIDQ2096528

Léo Ducas, Mélissa Rossi, Huijing Gong, Dana Dachman-Soled

Publication date: 9 November 2022

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

zbMATH Keywords

cryptanalysisLWENTRUlattice reductiondecryption failuresside-channels analysis

Mathematics Subject Classification ID

Cryptography (94A60) Channel models (including quantum) in information and communication theory (94A40)

Related Items (24)

SoK: how (not) to design and implement post-quantum cryptography ⋮ Solving the search-LWE problem over projected lattices ⋮ How to find ternary LWE keys using locality sensitive hashing ⋮ Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ Information-set decoding with hints ⋮ Multitarget Decryption Failure Attacks and Their Application to Saber and Kyber ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ Sieve algorithms for some orthogonal integer lattices ⋮ Improved power analysis attacks on Falcon ⋮ Generalized attack on ECDSA: known bits in arbitrary positions ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ A key-recovery attack against Mitaka in the \(t\)-probing model ⋮ S-semantics -- an example ⋮ EHNP strikes back: analyzing SM2 implementations ⋮ Handle the traces: revisiting the attack on ECDSA with EHNP ⋮ Partial key exposure attacks on BIKE, Rainbow and NTRU ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Estimating the hidden overheads in the BDGL lattice sieving algorithm ⋮ Revisiting security estimation for LWE with hints from a geometric perspective ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ On the success probability of solving unique SVP via BKZ ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ LWE with side information: attacks and concrete security estimation

Uses Software

• BKZ
• fpLLL

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of approximating extremal determinants in matrices
• LWE without modular reduction and improved side-channel attacks against BLISS
• Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
• Assessing the feasibility of single trace power analysis of Frodo
• Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
• Estimate all the {LWE, NTRU} schemes!
• LWE with side information: attacks and concrete security estimation
• Order-LWE and the hardness of ring-LWE with entropic secrets
• A refined analysis of the cost for solving LWE via uSVP
• Revisiting the expected cost of solving uSVP and applications to LWE
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• BKZ 2.0: Better Lattice Security Estimates
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Minkowski's Convex Body Theorem and Integer Programming
• Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

This page was built for publication: LWE with side information: attacks and concrete security estimation