Floating-Point LLL: Theoretical and Practical Aspects
From MaRDI portal
Publication:5188541
DOI10.1007/978-3-642-02295-1_5zbMath1186.65052OpenAlexW1751164779MaRDI QIDQ5188541
Publication date: 5 March 2010
Published in: The LLL Algorithm (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02295-1_5
LLL algorithmGram-Schmidt orthogonalisationrational arithmeticEuclid's gcd algorithmfloating-point approximation
Symbolic computation and algebraic computation (68W30) Orthogonalization in numerical linear algebra (65F25)
Related Items (10)
Towards faster polynomial-time lattice reduction ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ Segment LLL reduction of lattice bases using modular arithmetic ⋮ Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices ⋮ An Efficient Algorithm for Integer Lattice Reduction ⋮ Cryptanalysis of a quadratic compact knapsack public-key cryptosystem ⋮ Gradual sub-lattice reduction and a new complexity for factoring polynomials ⋮ Rigorous and Efficient Short Lattice Vectors Enumeration ⋮ A Vectorized, Cache Efficient LLL Implementation ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey
Uses Software
This page was built for publication: Floating-Point LLL: Theoretical and Practical Aspects
