{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00206820","sets":["1164:2240:10178:10320"]},"path":["10320"],"owner":"44499","recid":"206820","title":["最短格子ベクトル問題求解におけるUbiquity Generator Frameworkを用いた大規模MPI並列化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2020-09-18"},"_buckets":{"deposit":"f16ca835-e694-4cd9-aa31-15162ce1628e"},"_deposit":{"id":"206820","pid":{"type":"depid","value":"206820","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"最短格子ベクトル問題求解におけるUbiquity Generator Frameworkを用いた大規模MPI並列化","author_link":["514916","514918","514921","514920","514917","514919"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最短格子ベクトル問題求解におけるUbiquity Generator Frameworkを用いた大規模MPI並列化"},{"subitem_title":"Massive MPI Parallelization for Solving Shortest Vector Problem Based on Ubiquity Generator Framework","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"大規模並列処理","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2020-09-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学"},{"subitem_text_value":"Zuse Institute Berlin (ZIB)"},{"subitem_text_value":"九州大学"},{"subitem_text_value":"九州大学"},{"subitem_text_value":"立教大学"},{"subitem_text_value":"九州大学"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/206820/files/IPSJ-HPC20176001.pdf","label":"IPSJ-HPC20176001.pdf"},"date":[{"dateType":"Available","dateValue":"2022-09-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC20176001.pdf","filesize":[{"value":"3.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"cedfe9be-b46e-40ed-82f2-3df898d7bff1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2020 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"立岩, 斉明"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"品野, 勇治"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"吉田, 明広"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鍛冶, 静雄"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"安田, 雅哉"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"藤澤, 克樹"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10463942","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8841","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"格子暗号は，古典計算機や量子計算機からの攻撃に対しても安全であると考えられており，次世代の暗号化技術として注目されている．その本質的な安全性は，最短ベクトル問題 (SVP) の求解困難性に依存しており，セキュリティレベルを決定するために大規模計算機により SVP の難易度を正確に推定することが重要である．本研究では，世界初の分散型非同期並列 SVP ソルバーである MAssively Parallel solver for SVP (MAP-SVP) を開発した．MAP-SVP は分枝限定ソルバの汎用ソフトフェアである Ubiquity Generator framework を適用することで非同期的に情報を共有しながら SVP アルゴリズムを大規模に並列実行することが可能になった．MAP-SVP の性能を実証するために Darmstadt SVP チャレンジのインスタンスを複数解き，最大 91,200 のコア数を用いた実行により 127 次元の記録を更新した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Lattice-based cryptography is considered the next generation encryption technique because it is believed to be secure against attacks from classical and quantum computers. Its security depends essentially on the difficulty of solving the shortest vector problem (SVP). It is important to estimate the hardness of solving SVP by high-performance computers to determine the security level. In this study, we develop the world's first distributed and asynchronous parallel SVP solver, the MAssively Parallel solver for SVP (MAP-SVP). This solver can parallelize the SVP algorithm on a large scale while sharing information asynchronously by applying the Ubiquity Generator framework, which is a generic framework for branch-and-bound algorithms. We demonstrate the performance of the MAP-SVP by solving instances of the Darmstadt SVP challenge, and MAP-SVP marked a new record at 127 dimension by using up to 91,200 cores.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"10","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2020-09-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2020-HPC-176"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":206820,"updated":"2025-01-19T19:18:21.188609+00:00","links":{},"created":"2025-01-19T01:08:45.194632+00:00"}