Abstract
The security of lattice-based cryptosystems is determined by the performance of practical implementations of, among others, algorithms for the Shortest Vector Problem (SVP). In this paper, we conduct a comprehensive, empirical comparison of two SVP-solvers: ListSieve and GaussSieve. We also propose a practical parallel implementation of ListSieve, which achieves super-linear speedups on multi-core CPUs, with efficiency levels as high as 183%. By comparing our implementation with a parallel implementation of GaussSieve, we show that ListSieve can, in fact, outperform GaussSieve for a large number of threads, thus answering a question that was still open to this day.
Author supplied keywords
Cite
CITATION STYLE
Mariano, A., Dagdelen, özgür, & Bischof, C. (2014). A comprehensive empirical comparison of parallel listsieve and gausssieve. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8805, pp. 48–59). Springer Verlag. https://doi.org/10.1007/978-3-319-14325-5_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
