Pages that link to "Item:Q2878827"
From MaRDI portal
The following pages link to A sieve algorithm based on overlattices (Q2878827):
Displaying 11 items.
- (EC)DSA lattice attacks based on Coppersmith's method (Q280950) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
- (Q3495446) (← links)
- Sieve algorithms for the shortest vector problem are practical (Q3537523) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
