Litcius/Paper detail

Faster Enumeration-Based Lattice Reduction: Root Hermite Factor $$k^{1/(2k)}$$ Time $$k^{k/8+o(k)}$$

M. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé, Weiqiang Wen

2020Lecture notes in computer science33 citationsDOI

Topics & Concepts

EnumerationHermite polynomialsReduction (mathematics)HeuristicLattice (music)Lattice reductionCryptographyCombinatoricsFactor (programming language)Time complexityRoot (linguistics)Discrete mathematicsComputer scienceMathematicsAlgorithmMathematical optimizationGeometryStatisticsPhysicsPure mathematicsProgramming languageAcousticsLinguisticsBeamformingPhilosophyMIMOCryptography and Data SecurityCoding theory and cryptographyCryptography and Residue Arithmetic
Faster Enumeration-Based Lattice Reduction: Root Hermite Factor $k^{1/(2k)}$ Time $k^{k/8+o(k)}$ | Litcius