Fixed Complexity LLL Algorithm

DOI10.1109/TSP.2008.2011827MaRDI QIDQ4571663zbMATH OpenFDO

Authors Henning Vetter, Vishakan Ponnampalam, Magnus Sandell, Peter Hoeher

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2008.2011827

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cited in

(3)

• scientific article; zbMATH DE number 1512702 (Why is no real title available?)
• Parallel Cholesky-based reduction for the weighted integer least squares problem
• Analysis of the upper bound on the complexity of LLL algorithm

This page was built for publication: Fixed Complexity LLL Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571663)