Pages that link to "Item:Q2292890"
From MaRDI portal
The following pages link to The general sieve kernel and new records in lattice reduction (Q2292890):
Displayed 39 items.
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- G6K (Q1353858) (← links)
- Analysis of DeepBKZ reduction for finding short lattice vectors (Q2004968) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← 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)
- The convergence of slide-type reductions (Q2061912) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Solving the search-LWE problem over projected lattices (Q2146741) (← links)
- Attacking ECDSA leaking discrete bits with a more efficient lattice (Q2151304) (← links)
- Making the BKW algorithm practical for LWE (Q2152043) (← links)
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation (Q2231762) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS (Q6045071) (← links)
- Generalized attack on ECDSA: known bits in arbitrary positions (Q6063142) (← links)
- On the hardness of the finite field isomorphism problem (Q6083668) (← links)
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice (Q6083669) (← links)
- EHNP strikes back: analyzing SM2 implementations (Q6103105) (← links)
- Handle the traces: revisiting the attack on ECDSA with EHNP (Q6108775) (← links)
- Partial key exposure attacks on BIKE, Rainbow and NTRU (Q6108986) (← links)
- Development and analysis of massive parallelization of a lattice basis reduction algorithm (Q6139332) (← links)
- Does the dual-sieve attack on learning with errors even work? (Q6145940) (← links)
- Finding short integer solutions when the modulus is small (Q6145944) (← links)
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms (Q6159444) (← links)
- Estimating the hidden overheads in the BDGL lattice sieving algorithm (Q6166998) (← links)
