Pages that link to "Item:Q2875162"
From MaRDI portal
The following pages link to A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (Q2875162):
Displaying 44 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- New lattice attacks on DSA schemes (Q293717) (← links)
- Improvements in closest point search based on dual HKZ-bases (Q391764) (← links)
- Correcting noisy exponentiation black-boxes modulo a prime (Q396612) (← links)
- On the modular inversion hidden number problem (Q412197) (← links)
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- The closest vector problem in tensored root lattices of type A and in their duals (Q1692156) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Covering convex bodies and the closest vector problem (Q2136842) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- How (Not) to Instantiate Ring-LWE (Q2827731) (← 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)
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
- Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
- Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices (Q3078387) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices (Q3100319) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)
- Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms (Q5743489) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)
- Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method (Q6051902) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
- From approximate to exact integer programming (Q6085992) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)