Pages that link to "Item:Q5176018"
From MaRDI portal
The following pages link to A sieve algorithm for the shortest lattice vector problem (Q5176018):
Displaying 50 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- The extended \(k\)-tree algorithm (Q431783) (← links)
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors (Q515394) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- Probability method for cryptanalysis of general multivariate modular linear equation (Q848370) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Jug measuring: algorithms and complexity (Q924133) (← links)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
- Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) (Q1746982) (← links)
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- Security of most significant bits of \(g^{x^{2}}\). (Q1853041) (← links)
- Computing sparse multiples of polynomials (Q1934308) (← links)
- Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors (Q1938739) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- Noisy polynomial interpolation modulo prime powers (Q2034569) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← links)
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Improved lattice enumeration algorithms by primal and dual reordering methods (Q2104429) (← 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)
- Pseudorandom functions in NC class from the standard LWE assumption (Q2243895) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← 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)
- Scalable revocable identity-based signature over lattices in the standard model (Q2662710) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (Q2796401) (← links)
- How (Not) to Instantiate Ring-LWE (Q2827731) (← links)
- A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829) (← links)