A parallel LLL algorithm

  • Authors:

  • Yixian Luo;Sanzheng Qiao

  • Affiliations:

  • McMaster University, Hamilton, Ontario, Canada;McMaster University, Hamilton, Ontario, Canada

  • Venue:
  • Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, the original LLL is sequential in nature. In this paper, we present a multi-threading LLL algorithm based on a recently improved version: an LLL algorithm with delayed size reduction.