The following pages link to (Q4542515):
Displayed 50 items.
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels (Q290516) (← links)
- An efficient lattice reduction using reuse technique blockwisely on NTRU (Q317407) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- Lower bounds of shortest vector lengths in random NTRU lattices (Q477183) (← links)
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors (Q515394) (← links)
- Cryptanalysis of the GGH cryptosystem (Q626951) (← links)
- Improved strategies for branching on general disjunctions (Q652284) (← links)
- \((2,2)\) superconformal bootstrap in two dimensions (Q683013) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
- The optimal LLL algorithm is still polynomial in fixed dimension. (Q1401288) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) (← links)
- Planckian axions and the weak gravity conjecture (Q1638133) (← links)
- Segment LLL reduction of lattice bases using modular arithmetic (Q1662551) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Minimal condition for shortest vectors in lattices of low dimension (Q1739940) (← links)
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction (Q1744015) (← links)
- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) (Q1750386) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- Random lattices, threshold phenomena and efficient reduction algorithms. (Q1853481) (← 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)
- Vulnerable public keys in NTRU cryptosystem (Q1997177) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- Algorithmically solving the tadpole problem (Q2067210) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← 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)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Ciphertext-only attacks against compact-LWE submitted to NIST PQC project (Q2165453) (← links)
- New orthogonality criterion for shortest vector of lattices and its applications (Q2192090) (← links)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← 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)
- Detecting squarefree numbers (Q2263800) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← 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)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Counting lattice vectors (Q2643017) (← links)
- Revisiting lower dimension lattice attacks on NTRU (Q2681396) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← 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)