Pages that link to "Item:Q2820508"
From MaRDI portal
The following pages link to Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator (Q2820508):
Displaying 25 items.
- Second order statistical behavior of LLL and BKZ (Q1746949) (← links)
- Vulnerable public keys in NTRU cryptosystem (Q1997177) (← links)
- Analysis of DeepBKZ reduction for finding short lattice vectors (Q2004968) (← links)
- The convergence of slide-type reductions (Q2061912) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← 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)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← 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)
- 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)
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack (Q2415416) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- A lattice reduction algorithm based on sublattice BKZ (Q2697920) (← links)
- An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem (Q3297526) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970) (← links)
- Generalized attack on ECDSA: known bits in arbitrary positions (Q6063142) (← links)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- A refined hardness estimation of LWE in two-step mode (Q6635818) (← links)
- Quantum lattice enumeration in limited depth (Q6652982) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
