An LLL algorithm with quadratic complexity
From MaRDI portal
Publication:3575152
Recommendations
Cited in
(59)- Methodologies of Symbolic Computation
- Improved computation of polynomial roots over number fields when using complex embeddings
- A polynomial-time algorithm for solving the hidden subset sum problem
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Refined analysis to the extended tower number field sieve
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
- A pivoted LLL algorithm
- Towards faster polynomial-time lattice reduction
- Deterministic factoring with oracles
- The optimal LLL algorithm is still polynomial in fixed dimension.
- Progress on LLL and lattice reduction
- Selected applications of LLL in number theory
- An improved LLL algorithm
- Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction
- Two-torsion subgroups of some modular Jacobians
- A generalization of LLL lattice basis reduction over imaginary quadratic fields
- The history of the LLL-algorithm
- A practical algorithm for completing half-Hadamard matrices using LLL
- Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- On the quantum complexity of the continuous hidden subgroup problem
- Cryptanalysis of a homomorphic encryption scheme over integers
- Effect of the interval-symbol method with correct zero rewriting on the \(\delta\)-LLL algorithm
- Analysis of the upper bound on the complexity of LLL algorithm
- LLL reduction and a conjecture of Gunnells
- Common modulus attacks on small private exponent RSA and some fast variants (in practice)
- A formalization of the LLL basis reduction algorithm
- Fast practical lattice reduction through iterated compression
- On the modular inversion hidden number problem
- scientific article; zbMATH DE number 1942456 (Why is no real title available?)
- Linear forms in logarithms and the mathematical method of Diophantine equations: applications in chemistry and physics
- H-LLL: using Householder inside LLL
- Approximating the densest sublattice from Rankin's inequality
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- Improved Herrmann-May's attack with merging variables and lower LLL bound
- Adaptive precision floating point LLL
- A parametric version of LLL and some consequences: parametric shortest and closest vector problems
- Generalized cryptanalysis of small CRT-exponent RSA
- Searching worst cases of a one-variable function using lattice reduction
- scientific article; zbMATH DE number 1512702 (Why is no real title available?)
- Computing an LLL-reduced basis of the orthogonal latice
- Parallel Cholesky-based reduction for the weighted integer least squares problem
- Computing points of bounded height in projective space over a number field
- An experimental comparison of some LLL-type lattice basis reduction algorithms
- On the computation of the HNF of a module over the ring of integers of a number field
- Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors
- An efficient lattice reduction using reuse technique blockwisely on NTRU
- An LLL algorithm for module lattices
- Recovering exact results from inexact numerical data in algebraic geometry
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- scientific article; zbMATH DE number 3958726 (Why is no real title available?)
- Certified lattice reduction
- A verified efficient implementation of the LLL basis reduction algorithm
- Small CRT-exponent RSA revisited
- Algorithmic Number Theory
- An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
- List decoding of number field codes
- Algebraic number fields and the LLL algorithm
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
This page was built for publication: An LLL algorithm with quadratic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575152)
