Pages that link to "Item:Q2820509"
From MaRDI portal
The following pages link to Practical, Predictable Lattice Basis Reduction (Q2820509):
Displaying 50 items.
- Calculation of Minkowski-reduced lattice bases (Q762199) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Second order statistical behavior of LLL and BKZ (Q1746949) (← links)
- Analysis of DeepBKZ reduction for finding short lattice vectors (Q2004968) (← 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)
- The convergence of slide-type reductions (Q2061912) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← 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)
- 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)
- Self-dual DeepBKZ for finding short lattice vectors (Q2191205) (← links)
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation (Q2231762) (← links)
- TFHE: fast fully homomorphic encryption over the torus (Q2303454) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- Bounding basis reduction properties (Q2364641) (← links)
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack (Q2415416) (← links)
- Detecting unnecessary reductions in an involutive basis computation (Q2456593) (← links)
- Sharper bounds on four lattice constants (Q2672303) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- A lattice reduction algorithm based on sublattice BKZ (Q2697920) (← links)
- (Q2739440) (← links)
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds (Q2958113) (← links)
- (Q4408026) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- Revisiting Lattice Attacks on Overstretched NTRU Parameters (Q5738868) (← links)
- Computing Generator in Cyclotomic Integer Rings (Q5738871) (← links)
- Algorithmic Number Theory (Q5899253) (← links)
- Generalized attack on ECDSA: known bits in arbitrary positions (Q6063142) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
- EHNP strikes back: analyzing SM2 implementations (Q6103105) (← links)
- Shorter hash-and-sign lattice-based signatures (Q6104336) (← links)
- Subfield attacks on HSVP in ideal lattices (Q6134036) (← links)
- On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices (Q6134037) (← links)
- A sharper lower bound on Rankin's constant (Q6161436) (← links)
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices (Q6487348) (← links)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON (Q6595914) (← links)
- Towards compact identity-based encryption on ideal lattices (Q6636118) (← links)
- Quantum lattice enumeration in limited depth (Q6652982) (← links)
- Two-round threshold signature from algebraic one-more learning with errors (Q6653014) (← links)
