The security of lattice based cryptography can be considered to be based on the hardness of the shortest vector problem (SVP) in lattices. Sieving algorithms can be used to solve this problem, at least in small dimensions. The most promising among the sieving algorithms is GaussSieve. In this paper we present a parallel version of the GaussSieve algorithm that solves the shortest vector problem in lattices. For small number of up to 5 parallel threads, the parallel version scales nearly linearly. For bigger numbers of threads, the efficiency decreases. We implement the parallel GaussSieve on multicore CPUs, whereas the presented ideas can also be implemented on different parallel platforms. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Milde, B., & Schneider, M. (2011). A parallel implementation of GaussSieve for the shortest vector problem in lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6873 LNCS, pp. 452–458). https://doi.org/10.1007/978-3-642-23178-0_40
Mendeley helps you to discover research relevant for your work.