Pages that link to "Item:Q1101500"
From MaRDI portal
The following pages link to A hierarchy of polynomial time lattice basis reduction algorithms (Q1101500):
Displayed 50 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← 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)
- Another 80-dimensional extremal lattice (Q449686) (← links)
- ETRU: NTRU over the Eisenstein integers (Q488263) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) (← links)
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (Q757465) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- On Lovász' lattice reduction and the nearest lattice point problem (Q1076512) (← links)
- Simultaneously good bases of a lattice and its reciprocal lattice (Q1119682) (← links)
- Improved low-density subset sum algorithms (Q1207335) (← links)
- Simultaneous reduction of a lattice basis and its reciprocal basis (Q1311020) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- The optimal LLL algorithm is still polynomial in fixed dimension. (Q1401288) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Segment LLL reduction of lattice bases using modular arithmetic (Q1662551) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
- Second order statistical behavior of LLL and BKZ (Q1746949) (← links)
- Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) (Q1746982) (← links)
- Solving market split problems with heuristical lattice reduction (Q1761840) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- Random lattices, threshold phenomena and efficient reduction algorithms. (Q1853481) (← links)
- A lattice-based public-key cryptosystem (Q1854277) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- Analysis of DeepBKZ reduction for finding short lattice vectors (Q2004968) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Noisy polynomial interpolation modulo prime powers (Q2034569) (← links)
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs (Q2048182) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← 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)
- The convergence of slide-type reductions (Q2061912) (← links)
- A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Search for combinatorial objects using lattice algorithms -- revisited (Q2115837) (← links)
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\) (Q2118552) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA (Q2152160) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Self-dual DeepBKZ for finding short lattice vectors (Q2191205) (← links)
- Characterizing overstretched NTRU attacks (Q2191207) (← links)