Pages that link to "Item:Q3537523"

The following pages link to Sieve algorithms for the shortest vector problem are practical (Q3537523):

Displaying 35 items.

• Computing efficiently the lattice width in any dimension (Q638564) (← links)
• Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
• Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
• Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
• Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
• Solving market split problems with heuristical lattice reduction (Q1761840) (← links)
• Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
• Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
• The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← 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)
• On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
• Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← links)
• Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
• How to meet ternary LWE keys (Q2128581) (← links)
• Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
• Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
• Estimating quantum speedups for lattice sieves (Q2692396) (← links)
• A lattice reduction algorithm based on sublattice BKZ (Q2697920) (← links)
• The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
• Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
• A sieve algorithm based on overlattices (Q2878827) (← links)
• (Q2913823) (← links)
• A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829) (← links)
• Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
• Tuple lattice sieving (Q2971007) (← links)
• Gauss Sieve Algorithm on GPUs (Q2975795) (← links)
• Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
• Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices (Q3078387) (← links)
• A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices (Q3100319) (← links)
• (Q5091027) (← links)
• (Q5111221) (← links)
• Sieve algorithms for some orthogonal integer lattices (Q6059067) (← links)
• Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
• Lattice-based cryptography: a survey (Q6183909) (← links)