Pages that link to "Item:Q2719121"
From MaRDI portal
The following pages link to The shortest vector in a lattice is hard to approximate to within some constant (Q2719121):
Displaying 50 items.
- Lower bounds of shortest vector lengths in random NTRU lattices (Q477183) (← links)
- ETRU: NTRU over the Eisenstein integers (Q488263) (← links)
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors (Q515394) (← links)
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment (Q857394) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- On the hardness of approximating shortest integer relations among rational numbers (Q1274930) (← links)
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors (Q1606967) (← links)
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Segment LLL reduction of lattice bases using modular arithmetic (Q1662551) (← links)
- A non-commutative cryptosystem based on quaternion algebras (Q1671643) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions (Q1961373) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Application of automorphic forms to lattice problems (Q2154470) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL (Q2209537) (← links)
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
- Restricted parameter range promise set cover problems are easy (Q2258109) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
- Revisiting lower dimension lattice attacks on NTRU (Q2681396) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- On the complexity of computing short linearly independent vectors and short bases in a lattice (Q2819600) (← links)
- Inapproximability of the shortest vector problem: toward a deterministic reduction (Q2913823) (← links)
- Complexity of lattice problems. Non-approximability and limits of non-approximability (Q2922519) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Anomaly-free sets of fermions (Q3441988) (← links)
- Hardness of approximating the shortest vector problem in lattices (Q3546301) (← links)
- On the limits of non-approximability of lattice problems (Q4542514) (← links)
- On the Lattice Distortion Problem (Q4606278) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
- Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
- A Parametric Version of LLL and Some Consequences: Parametric Shortest and Closest Vector Problems (Q5139657) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)
- On the unique shortest lattice vector problem (Q5941093) (← links)
- Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight (Q6043377) (← links)
- Patch Redundancy in Images: A Statistical Testing Framework and Some Applications (Q6175997) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
