TU Darmstadt / ULB / TUbiblio

Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP

Mariano, Artur ; Laarhoven, Thijs ; Bischof, Christian (2015):
Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP.
pp. 590-599, IEEE, 44th International Conference on Parallel Processing (ICPP 2015), Beijing, China, 01.-04.09., ISSN 01903918,
DOI: 10.1109/ICPP.2015.68,
[Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 2015
Creators: Mariano, Artur ; Laarhoven, Thijs ; Bischof, Christian
Title: Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP
Language: English
Publisher: IEEE
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)
Zentrale Einrichtungen
Zentrale Einrichtungen > University IT-Service and Computing Centre (HRZ)
Zentrale Einrichtungen > University IT-Service and Computing Centre (HRZ) > Hochleistungsrechner
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
Event Title: 44th International Conference on Parallel Processing (ICPP 2015)
Event Location: Beijing, China
Event Dates: 01.-04.09.
Date Deposited: 19 Jan 2016 16:20
DOI: 10.1109/ICPP.2015.68
URL / URN: https://ieeexplore.ieee.org/document/7349614
Identification Number: TUD-CS-2015-1243
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details
OAI 2.0-Basis-URL: https://tubiblio.ulb.tu-darmstadt.de/cgi/oai2 TUbiblio verwendet EPrints 3.
Drucken | Impressum | Datenschutzerklärung