{"updated":"2025-01-21T09:21:25.041266+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00106542","sets":["6164:6165:6462:7729"]},"path":["7729"],"owner":"11","recid":"106542","title":["3次元格子篩において用いられる格子点計算法の評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-10-15"},"_buckets":{"deposit":"7aff7758-7bbe-48be-9f57-68a140f3fec6"},"_deposit":{"id":"106542","pid":{"type":"depid","value":"106542","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"3次元格子篩において用いられる格子点計算法の評価","author_link":["12506","12503","12502","12501","12507","12508","12505","12504"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"3次元格子篩において用いられる格子点計算法の評価"},{"subitem_title":"A Verification of 3-Dimensional Lattice Sieve","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"拡大体，離散対数問題，数体篩法，格子篩","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2014-10-15","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学大学院数理学府"},{"subitem_text_value":"NTTセキュアプラットフォーム研究所"},{"subitem_text_value":"NTTセキュアプラットフォーム研究所"},{"subitem_text_value":"九州大学 マス・フォア・インダストリ研究所"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Mathematics Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"NTT Secure Platform Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Secure Platform Laboratories","subitem_text_language":"en"},{"subitem_text_value":"Institute of Mathematics for Industry","subitem_text_language":"en"}]},"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/106542/files/IPSJCSS2014019.pdf"},"date":[{"dateType":"Available","dateValue":"2016-10-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJCSS2014019.pdf","filesize":[{"value":"343.2 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"30"},{"tax":["include_tax"],"price":"0","billingrole":"46"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"ed0bf6fb-1c0e-4d74-9e35-b89404586c0c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"早坂, 健一郎"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"青木, 和麻呂"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"小林, 鉄太郎"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"高木, 剛"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kenichiro, Hayasaka","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazumaro, Aoki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tetsutaro, Kobayashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tsuyoshi, Takagi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"拡大体GF(p^n)上の離散対数問題の困難性は，ペアリング暗号の安全性基盤の一つである．数体篩法は拡大体GF(p^n)上の離散対数問題に対する現在最速の解法であるが，3次元以上の領域における網羅的かつ効率的な格子点計算が課題であった．これに対して著者らはCSS2013において3次元の領域における格子点計算法を提案した．また，ある条件を満たす格子に対し，上記の3次元格子点計算法を用いると網羅的に格子点を計算できることを実験により確かめた．本稿では，ある条件を満たす格子に対して3次元格子点計算法を用いれば，領域内の全ての格子点を効率的に計算可能であることを示す．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"142","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2014論文集"}],"bibliographicPageStart":"135","bibliographicIssueDates":{"bibliographicIssueDate":"2014-10-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2014"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:49:55.722240+00:00","id":106542,"links":{}}