The implementation of the parallel shortest vector enumerate in the block Korkin-Zolotarev method

TL;DR

This paper presents a parallel CPU implementation of the Kannan algorithm for the shortest vector problem within the Block Korkin-Zolotarev lattice reduction, demonstrating linear runtime improvements with increased threads.

Contribution

It introduces a parallel implementation of the Kannan algorithm using POSIX threads, achieving scalable performance for lattice reduction tasks.

Findings

Linear decrease in runtime with more threads

Effective parallelization of Kannan algorithm

Potential for faster lattice reduction computations

Abstract

This article present a parallel CPU implementation of Kannan algorithm for solving shortest vector problem in Block Korkin-Zolotarev lattice reduction method. Implementation based on Native POSIX Thread Library and show linear decrease of runtime from number of threads.