{"created":"2025-01-19T01:27:54.148206+00:00","updated":"2025-01-19T11:43:44.054798+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00228764","sets":["6164:6165:6462:11379"]},"path":["11379"],"owner":"44499","recid":"228764","title":["QFESTA: Efficient Algorithms and Parameters for FESTA using Quaternion Algebras"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-10-23"},"_buckets":{"deposit":"0a9c00b3-e168-44b5-8fef-2c7984ca58bb"},"_deposit":{"id":"228764","pid":{"type":"depid","value":"228764","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"QFESTA: Efficient Algorithms and Parameters for FESTA using Quaternion Algebras","author_link":["613793","613791","613794","613792"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"QFESTA: Efficient Algorithms and Parameters for FESTA using Quaternion Algebras"},{"subitem_title":"QFESTA: Efficient Algorithms and Parameters for FESTA using Quaternion Algebras","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"表層情報，マルウェア解析，系統樹，深層学習，マルチタスク学習，TTP（MITRE ATT&CK）","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2023-10-23","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTT 社会情報研究所"},{"subitem_text_value":"東京大学"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Social Informatics Laboratories","subitem_text_language":"en"},{"subitem_text_value":"The University of Tokyo","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/228764/files/IPSJ-CSS2023151.pdf","label":"IPSJ-CSS2023151.pdf"},"date":[{"dateType":"Available","dateValue":"2025-10-23"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSS2023151.pdf","filesize":[{"value":"330.4 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":"6eda2152-d1c6-4397-b5ff-370113a0ec67","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kohei, Nakagawa"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroshi, Onuki"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kohei, Nakagawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroshi, Onuki","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_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In 2023, Basso, Maino, and Pope proposed FESTA (Fast Encryption from Supersingular Torsion Attacks), an isogeny-based public-key encryption (PKE) protocol that uses the SIDH attack for decryption. In the same paper, they proposed a parameter for that protocol, but the parameter requires high-degree\nisogeny computations and is not expected to be efficient. In this paper, we introduce QFESTA (Quaternion Fast Encapsulation from Supersingular Torsion Attacks) a new variant of FESTA that works with better parameters using quaternion algebras and achieves INDCCA2 security in QROM by applying Fujisaki-Okamoto transform. Our protocol only requires (2, 2)-isogeny and 3-isogeny computations. This leads to a significant reduction in computational costs. In addition, our protocol has much smaller data sizes of public key and ciphertext than the original FESTA.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1114","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2023論文集"}],"bibliographicPageStart":"1108","bibliographicIssueDates":{"bibliographicIssueDate":"2023-10-23","bibliographicIssueDateType":"Issued"}}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":228764,"links":{}}