Pages that link to "Item:Q3563839"
From MaRDI portal
The following pages link to Lattice Enumeration Using Extreme Pruning (Q3563839):
Displayed 50 items.
- Another 80-dimensional extremal lattice (Q449686) (← links)
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors (Q515394) (← links)
- 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)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- Comment on: ``Sum of squares of uniform random variables'' by I. Weissman (Q1726716) (← links)
- Second order statistical behavior of LLL and BKZ (Q1746949) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- Analysis of DeepBKZ reduction for finding short lattice vectors (Q2004968) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← 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)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Improved lattice enumeration algorithms by primal and dual reordering methods (Q2104429) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Solving the search-LWE problem over projected lattices (Q2146741) (← links)
- An extension of Kannan's embedding for solving ring-based LWE problems (Q2149793) (← links)
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes (Q2152045) (← links)
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
- Self-dual DeepBKZ for finding short lattice vectors (Q2191205) (← links)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation (Q2231762) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- On the complexity of the BKW algorithm on LWE (Q2256097) (← links)
- Modular lattice signatures, revisited (Q2302153) (← links)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
- Just a Little Bit More (Q2790027) (← links)
- Parallel Implementation of BDD Enumeration for LWE (Q2822698) (← links)
- A sieve algorithm based on overlattices (Q2878827) (← 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)
- 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)
- Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm (Q3454866) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970) (← links)
- On the hardness of the finite field isomorphism problem (Q6083668) (← links)
- Development and analysis of massive parallelization of a lattice basis reduction algorithm (Q6139332) (← links)
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation (Q6157486) (← links)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)