{"updated":"2025-01-19T18:15:36.613522+00:00","links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00210132","sets":["1164:3925:10503:10504"]},"path":["10504"],"owner":"44499","recid":"210132","title":["耐量子暗号<i>Giophantus</i><sup>+</sup>暗号における多項式の項省略による線形代数攻撃の改良"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-08"},"_buckets":{"deposit":"c7201f24-47b5-4b58-a8d2-b04c06d42da9"},"_deposit":{"id":"210132","pid":{"type":"depid","value":"210132","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"耐量子暗号<i>Giophantus</i><sup>+</sup>暗号における多項式の項省略による線形代数攻撃の改良","author_link":["531313","531312","531311"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"耐量子暗号<i>Giophantus</i><sup>+</sup>暗号における多項式の項省略による線形代数攻撃の改良"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"暗号","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2021-03-08","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":"Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Osaka University / Japan Advanced Institute of 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/210132/files/IPSJ-CSEC21092035.pdf","label":"IPSJ-CSEC21092035.pdf"},"date":[{"dateType":"Available","dateValue":"2023-03-08"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSEC21092035.pdf","filesize":[{"value":"802.3 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":"44"}],"accessrole":"open_date","version_id":"06725d6f-4920-4f1f-8cda-c87df63f9fd8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11235941","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-8655","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"大規模な量子計算機が実現できると，現在利用されている RSA 暗号や楕円曲線暗号等の公開鍵暗号は解読可能となる．このため，量子計算機を用いても解読が困難となる暗号（耐量子暗号）方式の研究が活発になってきている．耐量子暗号の候補として，SAC2017 において秋山らは不定方程式暗号 Giophantus を発表した．Giophantus は環 Fq[t]/(tn-1) 上の不定方程式の最小解を求める問題を安全性の根拠とする．LWE 問題の一種である IE Ring-LWE (Indeterminate Equation version of Ring-Learning With Error) 問題が困難であれば，Giophantus 暗号は IND-CPA 安全である．SAC2019 において，代入攻撃と格子攻撃を組み合わせることにより，IE Ring-LWE 問題が容易に解かれてしまうことが室井，奥村，宮地らにより示されたが，その攻撃は環を Fq[t]/(tn+1) に変換した Giophantus+ には適用できない．本研究では，不定方程式の項集合や次数などのパラメータを変えて実験を行うことで，Giophantus+ に対する最適な攻撃手法を検討する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告コンピュータセキュリティ（CSEC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"35","bibliographicVolumeNumber":"2021-CSEC-92"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":210132,"created":"2025-01-19T01:11:23.894827+00:00"}