{"created":"2025-01-19T00:58:18.024375+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00192599","sets":["1164:2036:9343:9613"]},"path":["9613"],"owner":"44499","recid":"192599","title":["論理暗号化に対するSAT攻撃の効率的なアルゴリズムについて"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-11-28"},"_buckets":{"deposit":"e4fb5e73-267a-4248-817f-df943fe028db"},"_deposit":{"id":"192599","pid":{"type":"depid","value":"192599","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"論理暗号化に対するSAT攻撃の効率的なアルゴリズムについて","author_link":["449822","449824","449823","449821"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"論理暗号化に対するSAT攻撃の効率的なアルゴリズムについて"},{"subitem_title":"An efficient SAT-attack algorithm against logic encryption","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"アルゴリズム","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2018-11-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学大学院システム情報科学研究院"},{"subitem_text_value":"京都産業大学情報理工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Information Science and Electorical Engineering, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Information Science and Engineering, Kyoto Sangyo University","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/192599/files/IPSJ-SLDM18185027.pdf","label":"IPSJ-SLDM18185027.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM18185027.pdf","filesize":[{"value":"430.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"e8b6a090-05e9-496a-8f92-a87559eb48b2","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2018 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":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yusuke, Matsunaga","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masayoshi, Yoshimura","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","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-8639","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿では論理 IP の剽窃や盗用を防ぐための論理暗号化手法に対する攻撃手法である SAT 攻撃の効率的なアルゴリズムについて述べる．既存の SAT 攻撃アルゴリズムは従来の暗号化手法のほとんどを解読することが可能であるが，多大な計算時間を要する場合もある．これは SAT 問題を繰り返し解いていく際に追加される節の数が膨大になっていることに起因する．そこで，追加する節の元となっている論理回路の等価性を調べることで重複した節の追加を行わない改良版の SAT 攻撃アルゴリズムを開発した．実験結果によればほとんどの例題に対してより短い時間で処理を行っており，最大で 35 倍の高速化を達成している．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper presents a novel efficient SAT-attack algorithm for logic encryption. The existing SAT-attack algorithm can decrypt almost all encrypted circuits proposed so far, however, there are cases that it takes a huge amount of CPU time. This is because the number of clauses being added during the decryption increases drastically in that case. To overcome that problem, a novel algorithm is developed, which considers the equivallence of clauses to be added. Experiments show that the proposed algorithm is much faster than the existing algorithm.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告システムとLSIの設計技術（SLDM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2018-11-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"27","bibliographicVolumeNumber":"2018-SLDM-185"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"links":{},"id":192599,"updated":"2025-01-20T00:04:48.005997+00:00"}