Pages that link to "Item:Q2692396"
From MaRDI portal
The following pages link to Estimating quantum speedups for lattice sieves (Q2692396):
Displaying 11 items.
- Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← 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)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- A refined hardness estimation of LWE in two-step mode (Q6635818) (← links)
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE (Q6637580) (← links)
- Provable dual attacks on learning with errors (Q6637724) (← links)
- Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems (Q6644067) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
- Quantum lattice enumeration in limited depth (Q6652982) (← links)
- CryptAttackTester: high-assurance attack analysis (Q6652984) (← links)
