{"id":98204,"updated":"2025-01-21T12:30:30.065599+00:00","links":{},"created":"2025-01-18T23:44:30.114263+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00098204","sets":["6164:6165:6462:7437"]},"path":["7437"],"owner":"11","recid":"98204","title":["拡大体GF(<i>p<sup>n</sup></i>)上の数体篩法における3次元Lattice Sieveの構成"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-10-14"},"_buckets":{"deposit":"700e45aa-fbe3-4d7f-91e1-82b3ba19d631"},"_deposit":{"id":"98204","pid":{"type":"depid","value":"98204","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"拡大体GF(<i>p<sup>n</sup></i>)上の数体篩法における3次元Lattice Sieveの構成","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"拡大体GF(<i>p<sup>n</sup></i>)上の数体篩法における3次元Lattice Sieveの構成"},{"subitem_title":"A Construction of 3-Dimensional Lattice Sieve for Number Field Sieve over GF(<i>p<sup>n</sup></i>)","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"離散対数問題,数体篩法,拡大体,lattice sieve,ペアリング暗号","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2013-10-14","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":"Institiute 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/98204/files/IPSJCSS2013010.pdf"},"date":[{"dateType":"Available","dateValue":"2015-10-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJCSS2013010.pdf","filesize":[{"value":"315.9 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":"8326cec8-897b-4b9e-aca0-014e39257426","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"早坂, 健一郎"},{"creatorName":"青木, 和麻呂"},{"creatorName":"小林, 鉄太郎"},{"creatorName":"高木, 剛"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kenichiro, Hayasaka","creatorNameLang":"en"},{"creatorName":"Kazumaro, Aoki","creatorNameLang":"en"},{"creatorName":"Tetsutaro, Kobayashi","creatorNameLang":"en"},{"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)上の離散対数問題を安全性の基礎の一つとする.CRYPTO2006においてJouxらは,素体GF(p)上の離散対数問題に対する現在漸近的に最速の解法,数体篩法(JL03-NFS)を,拡大体GF(p^n)上へ拡張した数体篩法(JLSV06-NFS)を考案した.JL03-NFSでは,2次元の篩処理(2次元lattice sieve)を用いることで十分であったが,JLSV06-NFSでは,3次元以上の篩処理が必要となる.本稿では,JL03-NFSにおいて用いられる2次元lattice sieveを拡張した3次元lattice sieveを提案する.","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The security of pairing-based cryptography is based on the hardness of the discrete logarithm problem over GF(p^n).  Joux et al. proposed the number field sieve over GF(p^n) at CRYPTO 2006 (JLSV06-NFS).  JLSV06-NFS includes a sieving step of more than 2 dimensions.  In this paper, we present 3-dimensional lattice sieve as extension of 2-dimensional lattice sieve used by the number field sieve over GF(p).","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"77","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2013論文集"}],"bibliographicPageStart":"70","bibliographicIssueDates":{"bibliographicIssueDate":"2013-10-14","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"2013"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}