A more efficient algorithm for lattice basis reduction
Journal of Algorithms
Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
A course in computational algebraic number theory
A course in computational algebraic number theory
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
On the complexity of finding short vectors in integer lattices
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
Fast LLL-type lattice reduction
Information and Computation
Certification of the QR factor R and of lattice basis reducedness
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
An LLL-reduction algorithm with quasi-linear time complexity: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Lattice reduction algorithms: theory and practice
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Improving BDD cryptosystems in general lattices
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Rigorous Perturbation Bounds of Some Matrix Factorizations
SIAM Journal on Matrix Analysis and Applications
Gradual sub-lattice reduction and a new complexity for factoring polynomials
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Faster gaussian lattice sampling using lazy floating-point arithmetic
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Hi-index | 0.01 |
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are performed with floating-point arithmetic. We prove that a precision essentially equal to the dimension suffices to ensure that the output basis is reduced. H-LLL resembles the L2 algorithm of Nguyen and Stehlé that relies on a floating-point Cholesky algorithm. However, replacing Cholesky's algorithm by Householder's is not benign, as their numerical behaviors differ significantly. Broadly speaking, our correctness proof is more involved, whereas our complexity analysis is more direct. Thanks to the new orthogonalization strategy, H-LLL is the first LLL-type algorithm that admits a natural vectorial description, which leads to a complexity upper bound that is proportional to the progress performed on the basis (for fixed dimensions).