Pages that link to "Item:Q1648783"
From MaRDI portal
The following pages link to Shortest vector from lattice sieving: a few dimensions for free (Q1648783):
Displayed 30 items.
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- Analysis of DeepBKZ reduction for finding short lattice vectors (Q2004968) (← 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)
- 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)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Solving the search-LWE problem over projected lattices (Q2146741) (← links)
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation (Q2231762) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths (Q2329392) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- A lattice reduction algorithm based on sublattice BKZ (Q2697920) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS (Q6045071) (← links)
- Sieve algorithms for some orthogonal integer lattices (Q6059067) (← links)
- Generalized attack on ECDSA: known bits in arbitrary positions (Q6063142) (← links)
- A thorough treatment of highly-efficient NTRU instantiations (Q6091128) (← links)
- EHNP strikes back: analyzing SM2 implementations (Q6103105) (← links)
- Handle the traces: revisiting the attack on ECDSA with EHNP (Q6108775) (← links)
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW (Q6135457) (← links)
- Development and analysis of massive parallelization of a lattice basis reduction algorithm (Q6139332) (← links)
- Does the dual-sieve attack on learning with errors even work? (Q6145940) (← links)
- Finding short integer solutions when the modulus is small (Q6145944) (← links)
- Estimating the hidden overheads in the BDGL lattice sieving algorithm (Q6166998) (← links)