LWE with side information: attacks and concrete security estimation
From MaRDI portal
Publication:2096528
Recommendations
- Verifying solutions to LWE with implications for concrete security
- Integer LWE with non-subgaussian error and related attacks
- LWE without modular reduction and improved side-channel attacks against BLISS
- Predicting the concrete security of LWE against the dual attack using binary search
- Lattice decoding attacks on binary LWE
- Formally Bounding the Side-Channel Leakage in Unknown-Message Attacks
- Algebraic Side-Channel Attacks Beyond the Hamming Weight Leakage Model
- Single-trace side-channel attacks on masked lattice-based encryption
- On the asymptotic complexity of solving LWE
Cites work
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A refined analysis of the cost for solving LWE via uSVP
- Assessing the feasibility of single trace power analysis of Frodo
- Better key sizes (and attacks) for LWE-based encryption
- BKZ 2.0: Better lattice security estimates
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
- scientific article; zbMATH DE number 1979272 (Why is no real title available?)
- scientific article; zbMATH DE number 1859030 (Why is no real title available?)
- Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
- LWE with side information: attacks and concrete security estimation
- LWE without modular reduction and improved side-channel attacks against BLISS
- Minkowski's Convex Body Theorem and Integer Programming
- On the complexity of approximating extremal determinants in matrices
- Order-LWE and the hardness of ring-LWE with entropic secrets
- Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}
- Revisiting the expected cost of solving uSVP and applications to LWE
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(78)- LWE without modular reduction and improved side-channel attacks against BLISS
- Assessing the feasibility of single trace power analysis of Frodo
- Verifying solutions to LWE with implications for concrete security
- 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
- Solving the search-LWE problem over projected lattices
- How to find ternary LWE keys using locality sensitive hashing
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Information-set decoding with hints
- More practical single-trace attacks on the number theoretic transform
- 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
- Tight Analysis of Decryption Failure Probability of Kyber in Reality
- Post-quantum cryptography for healthcare: a number theory based two-factor mutual authentication and key exchange protocol over lattices for TMIS
- New NTRU Records with Improved Lattice Bases
- Do Not Bound to a Single Position: Near-Optimal Multi-positional Mismatch Attacks Against Kyber and Saber
- A lattice attack on CRYSTALS-Kyber with correlation power analysis
- \textsf{FuLeeca}: a Lee-based signature scheme
- Quantum augmented lattice attack on NTRU with side information
- On the multi-user security of LWE-based NIKE
- \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON
- NEV: faster and smaller NTRU encryption using vector decoding
- Too many hints -- when LLL breaks LWE
- SCA-LDPC: a code-based framework for key-recovery side-channel attacks on post-quantum encryption schemes
- On the concrete security of LWE with small secret
- Profiling side-channel attacks on Dilithium. A small bit-fiddling leak breaks it all
- Bit security analysis of lattice-based KEMs under plaintext-checking attacks
- Ring/module learning with errors under linear leakage -- hardness and applications
- A refined hardness estimation of LWE in two-step mode
- The complexity of algebraic algorithms for LWE
- Key recovery attack on the partial Vandermonde knapsack problem
- CryptAttackTester: high-assurance attack analysis
- FuLeakage: breaking FuLeeca by learning attacks
- Two-round threshold signature from algebraic one-more learning with errors
- Crowhammer: full key recovery attack on \textsc{Falcon} with a single Rowhammer bit flip
- Finding and protecting the weakest link. On side-channel attacks on \(\mathrm{y}\) in masked ML-DSA
- Refined attack on LWE with hints: constructing lattice via Gaussian elimination
- An improvement of the congruence solver of lattice isomorphism problem over totally real number fields and applications
- A generic framework for side-channel attacks against LWE-based cryptosystems
- Two-round threshold signature from algebraic one-more learning with errors
- Revisiting the security of approximate FHE with noise-flooding countermeasures
- One bit to rule them all -- imperfect randomness harms lattice signatures
- HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical
- Heuristic algorithm for solving restricted SVP and its applications
- Giant does not mean strong: cryptanalysis of BQTRU
- Weightwise (almost) perfectly balanced functions based on total orders
- Guidance for efficient selection of secure parameters for fully homomorphic encryption
- Improved provable reduction of NTRU and hypercubic lattices
- On the provable dual attack for LWE by modulus switching
- Fast slicer for Batch-CVP: making lattice hybrid attacks practical
- Predicting module-lattice reduction
- IND-CPA-D and KR-D security with reduced noise from the HintLWE problem
- A closer look at \textsc{Falcon}
- Cool + cruel = dual, and new benchmarks for sparse LWE
- Learning with errors with output dependencies: LWE, LWR, and physical learning problems under the same umbrella
- Refined modelling of the primal attack, and variants against Module-LWE
- One (noisy) bit to rule them all: key recovery from randomness leakage in ML-DSA
- \textsf{HAWK}: having automorphisms weakens key
- On the resilience order of weightwise almost perfectly balanced functions
- \textsf{FrodoKEM}: a CCA-secure learning with errors key encapsulation mechanism
- DAKE: bandwidth-efficient (U)AKE from double-KEM
- SoK: how (not) to design and implement post-quantum cryptography
This page was built for publication: LWE with side information: attacks and concrete security estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096528)
