Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm

DOI10.1137/S0097539795295626MaRDI QIDQ4210097zbMATH OpenFDO

Authors

Publication date 20 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539795295626

zbMATH Keywords

lattice basis reductionparallel algorithmsparallel computational complexity

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1263369
• scientific article; zbMATH DE number 3958726
• scientific article; zbMATH DE number 1186952
• Faster LLL-type Reduction of Lattice Bases
• A hierarchy of polynomial time lattice basis reduction algorithms

Cited in

(7)

• Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem
• Fast reduction of algebraic lattices over cyclotomic fields
• Towards faster polynomial-time lattice reduction
• A new parallel lattice reduction algorithm for BKZ reduced bases
• A parallel Jacobi-type lattice basis reduction algorithm
• scientific article; zbMATH DE number 1186952 (Why is no real title available?)
• scientific article; zbMATH DE number 1263369 (Why is no real title available?)

This page was built for publication: Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm

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