Massive Parallelization for Finding Shortest Lattice Vectors Based on Ubiquity Generator Framework

  • Lattice-based cryptography has received attention as a next-generation encryption technique, because it is believed to be secure against attacks by classical and quantum computers. Its essential security depends on the hardness of solving the shortest vector problem (SVP). In the cryptography, to determine security levels, it is becoming significantly more important to estimate the hardness of the SVP by high-performance computing. In this study, we develop the world’s first distributed and asynchronous parallel SVP solver, the MAssively Parallel solver for SVP (MAP-SVP). It can parallelize algorithms for solving the SVP by applying the Ubiquity Generator framework, which is a generic framework for branch-and-bound algorithms. The MAP-SVP is suitable for massive-scale parallelization, owing to its small memory footprint, low communication overhead, and rapid checkpoint and restart mechanisms. We demonstrate its performance and scalability of the MAP-SVP by using up to 100,032 cores to solve instances of the Darmstadt SVP Challenge.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Yuji Shinano, N. Tateiwa, S. Nakamura, A. Yoshida, M. Yasuda, S. Kaji, K. Fujisawa
Document Type:In Proceedings
Parent Title (English):2020 SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC)
First Page:834
Last Page:848
Year of first publication:2020
DOI:https://doi.org/10.1109/SC41405.2020.00064