{"updated":"2025-01-21T20:41:52.753565+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00077954","sets":["6164:6165:6462:6551"]},"path":["6551"],"owner":"10","recid":"77954","title":["冗長表現基底によるF_{(2^4)^2}上の逆元計算を用いたAESのSubBytes変換"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-10-12"},"_buckets":{"deposit":"08b464ca-9700-40ad-9ee5-c86b01d8e65a"},"_deposit":{"id":"77954","pid":{"type":"depid","value":"77954","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"冗長表現基底によるF_{(2^4)^2}上の逆元計算を用いたAESのSubBytes変換","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"冗長表現基底によるF_{(2^4)^2}上の逆元計算を用いたAESのSubBytes変換"},{"subitem_title":"SubBytes Transform for AES Adopting Inversion in F_{(2^4)^2} with Redundantly Represented Basis","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"共通鍵暗号・ハッシュ関数（２）","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2011-10-12","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":"岡山大学"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Okayama University","subitem_text_language":"en"},{"subitem_text_value":"Okayama University","subitem_text_language":"en"},{"subitem_text_value":"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/77954/files/IPSJCSS2011059.pdf"},"date":[{"dateType":"Available","dateValue":"2012-10-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJCSS2011059.pdf","filesize":[{"value":"278.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"44"},{"tax":["include_tax"],"price":"30000","billingrole":"5"}],"accessrole":"open_date","version_id":"9834452d-fa89-44e3-b849-c00ba3f84f48","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"根角, 健太"},{"creatorName":"野上, 保之"},{"creatorName":"森岡, 恵理"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kenta, Nekado","creatorNameLang":"en"},{"creatorName":"Yasuyuki, Nogami","creatorNameLang":"en"},{"creatorName":"Eri, Morioka","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":"AESのSubBytes変換では，線形解読法の対策として非線形処理である有限体F_{2^8}上の逆元計算を採用している．この逆元計算を回路実装する場合，最大遅延時間を短かくし，かつ可能な限り回路規模を小さく実装するためには，F_{2^8}の替わりに逐次拡大体上の逆元計算を利用することが望ましい．そこで本稿では，まず逐次拡大体F_{(2^4)^2}を構成するための既約多項式および基底の中で最適なものを模索する．さらに，逆元計算を高速化するため，F_{2^4}上の基底を冗長に表現する方法を提案する．その冗長に表現された基底を用いることで，逆元計算内部の処理の並列化を促し，回路規模を増大させることなく回路の最大遅延時間をより短くできることを示す．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A lot of improvements and optimizations for the hardware implementation of SB{} transform for AES, in detail inversion} in F, have been reported. Instead of the AES original F_{2^8}, it is known that not only its isomorphic tower field F_{((2^2)^2)^2} but also F_{(2^4)^2}  have more efficient inversions. Thus, this paper first considers efficient inversion in F_{(2^4)^2}  with conventional techniques. Moreover, in order to reduce the critical path delay of inversion in F_{(2^4)^2}, this paper proposes Redundantly Represented Basis (RRB).","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"348","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2011 論文集"}],"bibliographicPageStart":"343","bibliographicIssueDates":{"bibliographicIssueDate":"2011-10-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2011"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:33:25.958818+00:00","id":77954,"links":{}}