{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00218874","sets":["1164:6389:10832:10943"]},"path":["10943"],"owner":"44499","recid":"218874","title":["3次ツイストを持つペアリングフレンドリ曲線における効率的な疎乗算アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-07-12"},"_buckets":{"deposit":"792d20f8-e3a6-4265-aa62-272e9ce0a2ca"},"_deposit":{"id":"218874","pid":{"type":"depid","value":"218874","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"3次ツイストを持つペアリングフレンドリ曲線における効率的な疎乗算アルゴリズム","author_link":["570190","570188","570192","570193","570189","570191"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"3次ツイストを持つペアリングフレンドリ曲線における効率的な疎乗算アルゴリズム"},{"subitem_title":"An Efficient Sparse Multiplication Algorithm for Pairing-Friendly Elliptic Curves With Cubic Twist","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ICSS","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2022-07-12","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"三菱電機株式会社情報技術総合研究所"},{"subitem_text_value":"三菱電機株式会社情報技術総合研究所"},{"subitem_text_value":"産業技術総合研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Mitsubishi Electric Corporation Information Technology R&D Center","subitem_text_language":"en"},{"subitem_text_value":"Mitsubishi Electric Corporation Information Technology R&D Center","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Advanced Industrial Science and Technology","subitem_text_language":"en"}]},"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/218874/files/IPSJ-SPT22048030.pdf","label":"IPSJ-SPT22048030.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SPT22048030.pdf","filesize":[{"value":"935.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"46"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"c17ad22b-5a90-4b26-825d-30085914276f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"林田, 大輝"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"早坂, 健一郎"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"照屋, 唯紀"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Daiki, Hayashida","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kenichiro, Hayasaka","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tadanori, Teruya","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12628305","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-8671","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ペアリング計算は関数型暗号や電子署名をはじめ，多様な高機能暗号で用いられる基本的な演算であり，Miller loop と最終べき計算の二つの演算からなる．本論文では，Miller loop で出現する疎乗算に注目し，3 次ツイストを持つ楕円曲線に適用可能な Toom-Cook 法をベースとする効率的な 3 次拡大体上の疎乗算アルゴリズムを提案する．本論文で提案する乗算アルゴリズムは，素体上の定数倍の回数を増加させる代わりに中間体上の加算回数を削減させることで計算コストの低減を図る．また，疎乗算を実行する元のどの係数が疎であっても疎乗算アルゴリズムを適用可能とする新たなテクニックを提案する．各埋め込み次数 ???? に対して，今回の疎乗算アルゴリズムが有効となる条件を評価し，特に ????  = 21, 27 の 3 次ツイストを持つ楕円曲線においては素体の乗算加算コスト比に関わらず，今回の疎乗算アルゴリズムが最も効率的であることを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose an efficient sparse multiplication algorithm on elliptic curves with cubic twist based on the Toom-Cook method. The multiplication algorithm we propose reduces the complexity by reducing the number of addition operations on the extension field to the number of constant multiplication on the prime field.We give a new technique that enables the application of the sparse multiplication algorithm regardless of which coefficient is sparse in the Miller loop.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告セキュリティ心理学とトラスト（SPT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-07-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"30","bibliographicVolumeNumber":"2022-SPT-48"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":218874,"updated":"2025-01-19T15:00:10.865080+00:00","links":{},"created":"2025-01-19T01:19:13.089191+00:00"}