Parallel lattice basis reduction

Publisher Website
Google Scholar
Abstract
The famous L3 algorithm for lattice basis reduction k parallelizecl. Using a dktributed memory architecture compntationaJ model, the algorithm we propose efficient y uses 0( n2 ) processors, where n is the dimension of the bask to reduce. Its implementation, realized on a massively parallel machine, allows us to conduct many experimentations. The first results are presented in this paper. We show that high speed-ups are obtained even for large amounts of processors, and give new ernpiricti knowledge of the L3 sequential complexity.

This publication has 0 references indexed in Scilit: