Mariano, Artur ; Laarhoven, Thijs ; Bischof, Christian (2017)
A Parallel Variant of LDSieve for the SVP on Lattices.
2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP).
doi: 10.1109/PDP.2017.60
Conference or Workshop Item, Bibliographie
Abstract
In this paper, we propose a parallel implementation of LDSieve, a recently published sieving algorithm for the SVP, which achieves the best theoretical complexity to this day, on parallel shared-memory systems. In particular, we propose a scalable parallel variant of LDSieve that is probabilistically lock-free and relaxes the properties of the algorithm to favour parallelism. We use our parallel variant of LDSieve to answer a number of important questions pertaining to the algorithm. In particular, we show that LDSieve scales fairly well on shared-memory systems and uses much less memory than HashSieve on random lattices, for the same or even less execution time.
| Item Type: | Conference or Workshop Item |
|---|---|
| Erschienen: | 2017 |
| Creators: | Mariano, Artur ; Laarhoven, Thijs ; Bischof, Christian |
| Type of entry: | Bibliographie |
| Title: | A Parallel Variant of LDSieve for the SVP on Lattices |
| Language: | English |
| Date: | 6 March 2017 |
| Publisher: | IEEE |
| Book Title: | 2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP) |
| Event Title: | 2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP) |
| DOI: | 10.1109/PDP.2017.60 |
| URL / URN: | https://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber... |
| Abstract: | In this paper, we propose a parallel implementation of LDSieve, a recently published sieving algorithm for the SVP, which achieves the best theoretical complexity to this day, on parallel shared-memory systems. In particular, we propose a scalable parallel variant of LDSieve that is probabilistically lock-free and relaxes the properties of the algorithm to favour parallelism. We use our parallel variant of LDSieve to answer a number of important questions pertaining to the algorithm. In particular, we show that LDSieve scales fairly well on shared-memory systems and uses much less memory than HashSieve on random lattices, for the same or even less execution time. |
| Uncontrolled Keywords: | Primitives; P1 |
| Divisions: | 20 Department of Computer Science 20 Department of Computer Science > Scientific Computing DFG-Collaborative Research Centres (incl. Transregio) DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres Profile Areas Profile Areas > Cybersecurity (CYSEC) DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres > CRC 1119: CROSSING – Cryptography-Based Security Solutions: Enabling Trust in New and Next Generation Computing Environments |
| Date Deposited: | 06 Sep 2018 13:29 |
| Last Modified: | 07 Jan 2021 09:48 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Send an inquiry |
Options (only for editors)
 |
Show editorial Details |
Drucken
Impressum