Pages that link to "Item:Q3612549"
From MaRDI portal
The following pages link to Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm (Q3612549):
Displaying 43 items.
- Improvements in closest point search based on dual HKZ-bases (Q391764) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
- Second order statistical behavior of LLL and BKZ (Q1746949) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- The convergence of slide-type reductions (Q2061912) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- Subexponential time relations in the class group of large degree number fields (Q2513760) (← links)
- Scalable revocable identity-based signature over lattices in the standard model (Q2662710) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- A sieve algorithm based on overlattices (Q2878827) (← links)
- Subexponential class group and unit group computation in large degree number fields (Q2878849) (← links)
- A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829) (← links)
- Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
- Reducing number field defining polynomials: an application to class group computations (Q2971018) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices (Q3078387) (← links)
- Sieve algorithms for the shortest vector problem are practical (Q3537523) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- LLL: A Tool for Effective Diophantine Approximation (Q5188542) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- Cryptography Based on Quadratic Forms: Complexity Considerations (Q5504549) (← links)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970) (← links)
- (Q5741633) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation (Q6157486) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)
- Attacking (EC)DSA scheme with ephemeral keys sharing specific bits (Q6499547) (← links)
- On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\) (Q6556574) (← links)
- A new bound for the orthogonality defect of HKZ reduced lattices (Q6573195) (← links)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
- Attacking (EC)DSA with partially known multiples of nonces (Q6647745) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
- On the smallest ratio problem of lattice bases (Q6666549) (← links)
