{"updated":"2025-01-21T21:23:58.313338+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00074794","sets":["6164:6165:6462:6463"]},"path":["6463"],"owner":"5","recid":"74794","title":["Freeman曲線を用いたXateおよびR–ateペアリングのための定義体における乗算アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-10-19"},"_buckets":{"deposit":"f6b617e2-8782-4e79-86ea-700d44618e68"},"_deposit":{"id":"74794","pid":{"type":"depid","value":"74794","revision_id":0},"owners":[5],"status":"published","created_by":5},"item_title":"Freeman曲線を用いたXateおよびR–ateペアリングのための定義体における乗算アルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Freeman曲線を用いたXateおよびR–ateペアリングのための定義体における乗算アルゴリズム"},{"subitem_title":"Multiplication Algorithms in The Extension Field for Xate andR–ate Pairings with Freeman Curve","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"公開鍵暗号","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2009-10-19","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":"岡山大学工学部通信ネットワーク工学科"},{"subitem_text_value":"岡山大学大学院自然科学研究科"},{"subitem_text_value":"岡山大学大学院自然科学研究科"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Natural Science and Technology,Okayama University","subitem_text_language":"en"},{"subitem_text_value":"Communication Network Engineering,Okayama University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Natural Science and Technology,Okayama University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Natural Science and Technology,Okayama University","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/74794/files/IPSJ-CSS2009B14.pdf"},"date":[{"dateType":"Available","dateValue":"2011-10-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSS2009B14.pdf","filesize":[{"value":"116.3 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":"44"}],"accessrole":"open_date","version_id":"f22e8cea-cf1c-4dfb-bce7-f5535cc70642","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2009 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":"Kenta, Nekado","creatorNameLang":"en"},{"creatorName":"Tatsuya, Yuasa","creatorNameLang":"en"},{"creatorName":"Yasuyuki, Nogami","creatorNameLang":"en"},{"creatorName":"Yoshitaka, Morikawa","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":"近年，ID ベース暗号やグループ電子署名に対して，ペアリングをベースに実装する方式が注目を集めている．これらの方式を高速化するためには，ペアリングアルゴリズムの改良だけではなく，定義体における演算も高速化することが重要である．そこで，著者らは効果的にペアリングベース暗号を実装することができる Freeman 曲線に注目し，SCIS2009 にて Freeman 曲線のための拡大体の構成法について考え，その拡大体上演算の高速化手法について提案した．本稿では，SCIS2009 で提案したものよりも高速な手法を追求し，その手法を用いたときの Xate および R–ate ペアリングの実装結果を示す．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Recently, pairing–based cryptographies such as ID–based cryptographic and groupsignature have been studied. For their implementations, pairings such as Xate pairing and R–atepairing have been efficient. In order to make pairing calculations faster, it is important to makenot only pairing algorithms but also arithmetic operations in the defined field efficient. Thus,in several kinds of ordinary pairing–friendly curves, we focused on Freeman curve that enablesimplementations of fast pairing–based cryptographies, and proposed efficient implementationmethods of arithmetic operations in the definition field, in SCIS2009. This paper proposes moreefficient methods, and shows implementation results of Xate pairing and R–ate pairing.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2009　(CSS2009) 論文集"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-10-12","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2009"}]},"relation_version_is_last":true,"weko_creator_id":"5"},"created":"2025-01-18T23:32:10.088135+00:00","id":74794,"links":{}}