TU Darmstadt / ULB / TUbiblio

A Parallel Variant of LDSieve for the SVP on Lattices

Mariano, Artur ; Laarhoven, Thijs ; Bischof, Christian :
A Parallel Variant of LDSieve for the SVP on Lattices.
[Online-Edition: https://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber...]
In: 2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP). 2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP) IEEE
[ Konferenzveröffentlichung] , (2017)

Offizielle URL: 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.

Typ des Eintrags: Konferenzveröffentlichung ( nicht bekannt)
Erschienen: 2017
Autor(en): Mariano, Artur ; Laarhoven, Thijs ; Bischof, Christian
Titel: A Parallel Variant of LDSieve for the SVP on Lattices
Sprache: Englisch
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.

Buchtitel: 2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)
Verlag: IEEE
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
Veranstaltungstitel: 2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)
Hinterlegungsdatum: 06 Sep 2018 13:29
DOI: 10.1109/PDP.2017.60
Offizielle URL: https://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber...
Export:

Optionen (nur für Redakteure)

Eintrag anzeigen Eintrag anzeigen