{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00241446","sets":["1164:6389:11481:11865"]},"path":["11865"],"owner":"44499","recid":"241446","title":["Giant Footprint Sharing: Classic McElieceの復号処理における省メモリ実装手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-11-26"},"_buckets":{"deposit":"a9f77a4b-a8c1-4177-a659-c124c5e6d4f1"},"_deposit":{"id":"241446","pid":{"type":"depid","value":"241446","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Giant Footprint Sharing: Classic McElieceの復号処理における省メモリ実装手法","author_link":["664650","664651","664648","664652","664649","664647","664646","664653"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Giant Footprint Sharing: Classic McElieceの復号処理における省メモリ実装手法"},{"subitem_title":"A Memory-Efficient Decryption Implementation for Classic McEliece","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"認証","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-11-26","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"パナソニック株式会社"},{"subitem_text_value":"パナソニックホールディングス株式会社"},{"subitem_text_value":"パナソニックホールディングス株式会社"},{"subitem_text_value":"パナソニック株式会社"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Panasonic Corporation","subitem_text_language":"en"},{"subitem_text_value":"Panasonic Holdings Corporation","subitem_text_language":"en"},{"subitem_text_value":"Panasonic Holdings Corporation","subitem_text_language":"en"},{"subitem_text_value":"Panasonic Corporation","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/241446/files/IPSJ-SPT24057024.pdf","label":"IPSJ-SPT24057024.pdf"},"date":[{"dateType":"Available","dateValue":"2026-11-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SPT24057024.pdf","filesize":[{"value":"1.9 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"46"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"08876ae4-40bb-428b-81c5-bcd1990cf67e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"劉, 聰"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"矢内, 直人"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"西田, 直央"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"丸子, 彰"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Cong, Liu","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Naoto, Yanai","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Naohisa, Nishida","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Akira, Maruko","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":"Classic McEliece は NIST による耐量子計算機暗号の標準化候補の暗号化方式として注目されている．しかしながら，復号処理の負荷が大きく，計算資源に制約のある環境には適さない．本稿では Classic McEliece の復号処理においてメモリサイズを削減する手法 Giant Footprint Sharing を提案する．大まかには，Classic McEliece では秘密情報から計算される多数の中間出力がメモリ上に格納されるが，Giant Footprint Sharing はこれらのうちボトルネックとなる部分を格納できる配列構造をメモリ上で共有することで，メモリサイズを削減する．Giant Footprint Sharing は高速フーリエ変換と併用することで高速化も可能である．Giant Footprint Sharing を Arm Cortex-M33 上で実装評価したところ，復号を扱う既存の高速実装 (Chenら，TCHES 2021) と比べて計算時間の実質的な劣化なく，メモリサイズを 46% まで削減できることを確認した．Giant Footprint Sharingについて詳細な検討を行ったところ，本稿の実装はいずれのコンパイラ最適化オプションを用いたとしてもメモリサイズが一定であること，また，メモリサイズと計算時間のトレードオフにおいて最適解となる実装であることも示す．本稿の手法は，大きな行列計算を含み，かつ，各変数のライフサイクルが短いアルゴリズムなら適用が期待できる．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Classic McEliece has garnered attention as a candidate in NIST post-quantum cryptography standardization. However, it suffers from high computational demands during the decryption process, making it unsuitable for resource-constrained devices. This paper proposes a method that reduces memory size during decryption in Classic McEliece. The decryption algorithm processes a large number of in-memory intermediate states computed from the secrets. We identify the largest state among them and implement a memory-sharing structure using it, thereby reducing the overall memory footprint. The proposed method can also be combined with existing acceleration techniques. We evaluate the proposed method on the Arm Cortex-M33 and show that our implementation reduces memory size by up to 46% without significant degradation in computation time compared to previous research (Chen et al., TCHES 2021). A detailed examination of the proposed method further reveals that our implementation maintains a constant memory size regardless of the compiler optimization, and it achieves an optimal balance in the trade-off.","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":"2024-11-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"24","bibliographicVolumeNumber":"2024-SPT-57"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":241446,"updated":"2025-01-19T07:40:15.365675+00:00","links":{},"created":"2025-01-19T01:46:03.297826+00:00"}