Pages that link to "Item:Q3457102"
From MaRDI portal
The following pages link to Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (Q3457102):
Displaying 28 items.
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Post-quantum key exchange for the Internet and the open quantum safe project (Q1698609) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← 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)
- Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- How to meet ternary LWE keys (Q2128581) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} (Q2170090) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
- Gauss Sieve Algorithm on GPUs (Q2975795) (← links)
- A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ (Q2988333) (← links)
- Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- (Q5111221) (← links)
- (Q5115825) (← links)
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm (Q5738781) (← links)
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL (Q5738971) (← links)
- New Results on the Remote Set Problem and Its Applications in Complexity Study (Q6489321) (← links)
