The LLL algorithm. Survey and applications

DOI10.1007/978-3-642-02295-1zbMath1179.11003MaRDI QIDQ1041163

No author found.

Publication date: 1 December 2009

Published in: Information Security and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02295-1

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

11Y50: Computer solution of Diophantine equations

11Y16: Number-theoretic algorithms; complexity

11-06: Proceedings, conferences, collections, etc. pertaining to number theory

Related Items

Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH, A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices, A note on the prime factorization method by Nemec et al., Generalized attack on ECDSA: known bits in arbitrary positions, Computational Number Theory, Past, Present, and Future, A generalized attack on the multi-prime power RSA, EHNP strikes back: analyzing SM2 implementations, Handle the traces: revisiting the attack on ECDSA with EHNP, An Efficient Algorithm for Integer Lattice Reduction, Improvements in closest point search based on dual HKZ-bases, PotLLL: a polynomial time version of LLL with deep insertions, Non-linear polynomial selection for the number field sieve, LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme, Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors, Cryptanalysis of Dual RSA, Natural density distribution of Hermite normal forms of integer matrices, An experimental comparison of some LLL-type lattice basis reduction algorithms, Montgomery's method of polynomial selection for the number field sieve, On the hardness of the computational ring-LWR problem and its applications, CSIDH: an efficient post-quantum commutative group action, On the optimality of lattices for the Coppersmith technique, Second order statistical behavior of LLL and BKZ, Dynamic trading under integer constraints, Orientable quadratic equations in free metabelian groups, Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\), Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP, Slide reduction, revisited -- filling the gaps in SVP approximation, A physical study of the LLL algorithm, A practical algorithm for completing half-Hadamard matrices using LLL, Search for combinatorial objects using lattice algorithms -- revisited, Revisiting orthogonal lattice attacks on approximate common divisor problems, Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, On the length of integers in telescopers for proper hypergeometric terms, A stochastic variant of the abelian sandpile model, A probabilistic analysis on a lattice attack against DSA, A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths, Bounding basis reduction properties, Sharper bounds on four lattice constants, \( L_1\)-norm ball for CSIDH: optimal strategy for choosing the secret key space, Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices, A lattice reduction algorithm based on sublattice BKZ, Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction, An Improved Analysis on Three Variants of the RSA Cryptosystem, Improved Results on Cryptanalysis of Prime Power RSA