Pages that link to "Item:Q1692148"
From MaRDI portal
The following pages link to On the asymptotic complexity of solving LWE (Q1692148):
Displaying 7 items.
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange (Q2051406) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- Making the BKW algorithm practical for LWE (Q2152043) (← links)
- Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm (Q5001674) (← links)
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms (Q6159444) (← links)
