The following pages link to (Q5417723):
Displayed 41 items.
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- On the number of lattice points in a small sphere and a recursive lattice decoding algorithm (Q1934244) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← 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)
- 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)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- Cryptanalysis of a quadratic compact knapsack public-key cryptosystem (Q2429000) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← 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)
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
- Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
- Gauss Sieve Algorithm on GPUs (Q2975795) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← 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)
- The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings (Q4595068) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- (Q5053992) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm (Q5738781) (← links)
- Revisiting Lattice Attacks on Overstretched NTRU Parameters (Q5738868) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)
- Lattice Sieving via Quantum Random Walks (Q6045073) (← links)
- Sieve algorithms for some orthogonal integer lattices (Q6059067) (← links)
- Tight bounds on the expected number of holes in random point sets (Q6077049) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
- Does the dual-sieve attack on learning with errors even work? (Q6145940) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)