Pages that link to "Item:Q5199206"
From MaRDI portal
The following pages link to Analyzing Blockwise Lattice Algorithms Using Dynamical Systems (Q5199206):
Displaying 40 items.
- PotLLL: a polynomial time version of LLL with deep insertions (Q398939) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← 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)
- The convergence of slide-type reductions (Q2061912) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513) (← 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)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- A physical study of the LLL algorithm (Q2112788) (← 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)
- 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)
- On the complexity of the BKW algorithm on LWE (Q2256097) (← 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 new parallel lattice reduction algorithm for BKZ reduced bases (Q2335926) (← links)
- Bounding basis reduction properties (Q2364641) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- A lattice reduction algorithm based on sublattice BKZ (Q2697920) (← links)
- A Subfield Lattice Attack on Overstretched NTRU Assumptions (Q2835586) (← 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)
- A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ (Q2988333) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Revisiting Lattice Attacks on Overstretched NTRU Parameters (Q5738868) (← links)
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL (Q5738971) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
- Dynamic Cantor Derivative Logic (Q6137850) (← links)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- A refined hardness estimation of LWE in two-step mode (Q6635818) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
- On the smallest ratio problem of lattice bases (Q6666549) (← links)
