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
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2017 |
| Autor(en): | Mariano, Artur ; Laarhoven, Thijs ; Bischof, Christian |
| Art des Eintrags: | Bibliographie |
| Titel: | A Parallel Variant of LDSieve for the SVP on Lattices |
| Sprache: | Englisch |
| Publikationsjahr: | 6 März 2017 |
| Verlag: | IEEE |
| Buchtitel: | 2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP) |
| Veranstaltungstitel: | 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... |
| Kurzbeschreibung (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. |
| Freie Schlagworte: | Primitives; P1 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Scientific Computing DFG-Sonderforschungsbereiche (inkl. Transregio) DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche Profilbereiche Profilbereiche > Cybersicherheit (CYSEC) DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1119: CROSSING – Kryptographiebasierte Sicherheitslösungen als Grundlage für Vertrauen in heutigen und zukünftigen IT-Systemen |
| Hinterlegungsdatum: | 06 Sep 2018 13:29 |
| Letzte Änderung: | 07 Jan 2021 09:48 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum