The general sieve kernel and new records in lattice reduction
From MaRDI portal
Publication:2292890
DOI10.1007/978-3-030-17656-3_25OpenAlexW2920734175MaRDI QIDQ2292890
Martin R. Albrecht, Gottfried Herold, Marc Stevens, Léo Ducas, Eamonn W. Postlethwaite, Elena Kirshanova
Publication date: 6 February 2020
Full work available at URL: https://ir.cwi.nl/pub/28539
Related Items (39)
Dual lattice attacks for closest vector problems (with preprocessing) ⋮ Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Towards faster polynomial-time lattice reduction ⋮ Lower bounds on lattice sieving and information set decoding ⋮ Sieve, Enumerate, Slice, and Lift: ⋮ Solving the search-LWE problem over projected lattices ⋮ G6K ⋮ Attacking ECDSA leaking discrete bits with a more efficient lattice ⋮ Making the BKW algorithm practical for LWE ⋮ Predicting the concrete security of LWE against the dual attack using binary search ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ Generalized attack on ECDSA: known bits in arbitrary positions ⋮ On the hardness of the finite field isomorphism problem ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ EHNP strikes back: analyzing SM2 implementations ⋮ Handle the traces: revisiting the attack on ECDSA with EHNP ⋮ Partial key exposure attacks on BIKE, Rainbow and NTRU ⋮ Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Does the dual-sieve attack on learning with errors even work? ⋮ Finding short integer solutions when the modulus is small ⋮ Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms ⋮ Estimating the hidden overheads in the BDGL lattice sieving algorithm ⋮ Improving convergence and practicality of slide-type reductions ⋮ Estimating quantum speedups for lattice sieves ⋮ The irreducible vectors of a lattice: some theory and applications ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters ⋮ Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation ⋮ Analysis of DeepBKZ reduction for finding short lattice vectors ⋮ Approximate Voronoi cells for lattices, revisited ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ The randomized slicer for CVPP: sharper, faster, smaller, batchier ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ Advanced lattice sieving on GPUs, with tensor cores ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ The convergence of slide-type reductions ⋮ On the success probability of solving unique SVP via BKZ ⋮ Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
Uses Software
This page was built for publication: The general sieve kernel and new records in lattice reduction
