Pages that link to "Item:Q2941568"

The following pages link to Solving the Shortest Vector Problem in 2 ⁿ Time Using Discrete Gaussian Sampling (Q2941568):

Displayed 33 items.

• Finding shortest lattice vectors faster using quantum search (Q887421) ‎ (← links)
• On the asymptotic complexity of solving LWE (Q1692148) ‎ (← links)
• Sieving for closest lattice vectors (with preprocessing) (Q1698670) ‎ (← links)
• Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) ‎ (← 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)
• Exact lattice sampling from non-Gaussian distributions (Q2061936) ‎ (← links)
• Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) ‎ (← links)
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) ‎ (← links)
• Lower bounds on lattice sieving and information set decoding (Q2128585) ‎ (← links)
• Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) ‎ (← links)
• A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) ‎ (← links)
• Property-preserving hash functions for Hamming distance from standard assumptions (Q2170070) ‎ (← links)
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) ‎ (← links)
• A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) ‎ (← links)
• How (Not) to Instantiate Ring-LWE (Q2827731) ‎ (← links)
• Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) ‎ (← links)
• Voronoi Cells of Lattices with Respect to Arbitrary Norms (Q3174772) ‎ (← links)
• Discrete Gaussian Distributions via Theta Functions (Q4634347) ‎ (← links)
• Lattice-based locality sensitive hashing is optimal (Q4993309) ‎ (← links)
• Sieve, Enumerate, Slice, and Lift: (Q5048976) ‎ (← links)
• Minimization of even conic functions on the two-dimensional integral lattice (Q5090143) ‎ (← links)
• (Q5091027) ‎ (← links)
• A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic (Q5091762) ‎ (← links)
• Hardness of bounded distance decoding on lattices in lp norms (Q5092487) ‎ (← links)
• A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices (Q5163506) ‎ (← links)
• Kissing Numbers and Transference Theorems from Generalized Tail Bounds (Q5232155) ‎ (← links)
• Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) ‎ (← links)
• An Inequality for Gaussians on Lattices (Q5346551) ‎ (← links)
• Approximate CVP_p in Time 2^{0.802 n} (Q5874513) ‎ (← links)
• Sampling the Riemann-theta Boltzmann machine (Q6040125) ‎ (← links)
• Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) ‎ (← links)
• Complexity of optimizing over the integers (Q6160281) ‎ (← links)
• Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) ‎ (← links)