PotLLL: a polynomial time version of LLL with deep insertions

DOI10.1007/s10623-014-9918-8zbMath1297.94067arXiv1212.5100OpenAlexW2040347389MaRDI QIDQ398939

Felix Fontein, Michael Schneider, Urs Wagner

Publication date: 18 August 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.5100

zbMATH Keywords

LLL algorithmdeep insertionlattice reduction

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60)

Related Items (3)

PotLLL: a polynomial time version of LLL with deep insertions ⋮ Analysis of DeepBKZ reduction for finding short lattice vectors ⋮ A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths

Uses Software

• DeepLLL
• PotLLL
• BKZ

Cites Work

• Unnamed Item
• Unnamed Item
• PotLLL: a polynomial time version of LLL with deep insertions
• The LLL algorithm. Survey and applications
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• BKZ 2.0: Better Lattice Security Estimates
• Lattice-based Cryptography
• Block Reduced Lattice Bases and Successive Minima
• Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
• Floating-Point LLL Revisited
• An LLL-reduction algorithm with quasi-linear time complexity
• Predicting Lattice Reduction
• Algorithmic Number Theory

This page was built for publication: PotLLL: a polynomial time version of LLL with deep insertions