Massive parallelization for finding shortest lattice vectors based on ubiquity generator framework

Nariaki Tateiwa, Yuji Shinano, Satoshi Nakamura, Akihiro Yoshida, Shizuo Kaji, Masaya Yasuda, Katsuki Fujisawa

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

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.

本文言語英語
ホスト出版物のタイトルProceedings of SC 2020
ホスト出版物のサブタイトルInternational Conference for High Performance Computing, Networking, Storage and Analysis
出版社IEEE Computer Society
ISBN(電子版)9781728199986
DOI
出版ステータス出版済み - 11 2020
イベント2020 International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2020 - Virtual, Atlanta, 米国
継続期間: 11 9 202011 19 2020

出版物シリーズ

名前International Conference for High Performance Computing, Networking, Storage and Analysis, SC
2020-November
ISSN(印刷版)2167-4329
ISSN(電子版)2167-4337

会議

会議2020 International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2020
国/地域米国
CityVirtual, Atlanta
Period11/9/2011/19/20

All Science Journal Classification (ASJC) codes

  • コンピュータ ネットワークおよび通信
  • コンピュータ サイエンスの応用
  • ハードウェアとアーキテクチャ
  • ソフトウェア

フィンガープリント

「Massive parallelization for finding shortest lattice vectors based on ubiquity generator framework」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル