A new parallel lattice reduction algorithm for BKZ reduced bases

In order to implement the original BKZ algorithm in parallel,we describe it in terms of parallelism and give its parallel implementation scheme. Then we analyze the efficiency of algorithm＇s parallel implementation and show that the speedup factor of BKZ algorithm in parallel is extremely low. Therefore we present a new parallel lattice reduction algorithm suitable for multiprocessor computer architecture. The new algorithm can obtain a BKZ reduced basis and the parallel speedup is effective. Also with the practical results,although the computational complexity increases compared with the original BKZ algorithm,we still indicate that the new algorithm performs well in parallel and the time cost in parallel is less. At the same time,we show that the length of the shortest vector is smaller.