{"links":{},"id":66453,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00066453","sets":["581:582:5904"]},"path":["5904"],"owner":"11","recid":"66453","title":["GF(3<sup><i>n</i></sup>) 上の関数体篩法の実装実験"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-09-15"},"_buckets":{"deposit":"e0a89761-f243-4e32-abf7-4479c5aaa38d"},"_deposit":{"id":"66453","pid":{"type":"depid","value":"66453","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"GF(3<sup><i>n</i></sup>) 上の関数体篩法の実装実験","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"GF(3<sup><i>n</i></sup>) 上の関数体篩法の実装実験"},{"subitem_title":"An Experiment on Implementation of the Function Field Sieve over GF(3<sup><i>n</i></sup>)","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"特集：社会を活性化するコンピュータセキュリティ技術","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2009-09-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"公立はこだて未来大学大学院システム情報科学研究科"},{"subitem_text_value":"公立はこだて未来大学大学院システム情報科学研究科"},{"subitem_text_value":"公立はこだて未来大学大学院システム情報科学研究科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Systems Information Science, Future University Hakodate","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Systems Information Science, Future University Hakodate","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Systems Information Science, Future University Hakodate","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/66453/files/IPSJ-JNL5009004.pdf"},"date":[{"dateType":"Available","dateValue":"2011-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5009004.pdf","filesize":[{"value":"295.0 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e0a5312c-3dbd-4c33-996d-7301ff3bfcf5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2009 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"林, 卓也"},{"creatorName":"白勢, 政明"},{"creatorName":"高木, 剛"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takuya, Hayashi","creatorNameLang":"en"},{"creatorName":"Masaaki, Shirase","creatorNameLang":"en"},{"creatorName":"Tsuyoshi, Takagi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"高速実装が可能な実用的ペアリングとして有限体GF(3<sup><i>n</i></sup>) 上の超特異曲線を用いたη<sub><i>T</i></sub> ペアリングが知られている．このη<sub><i>T</i></sub> ペアリングを利用したペアリング暗号の安全性はGF(3<sup><i>n</i></sup>) 上の離散対数問題（DLP）の困難性を根拠とする．しかし，GF(3<sup><i>n</i></sup>) 上のDLPの困難性に関する計算実験の報告は数例のみであり，その困難性の正確な評価を行うにはデータが不十分となっている．本稿では，小さな標数の有限体上のDLPに対する漸近的に最も高速な計算アルゴリズムとして知られている関数体篩法の高速実装を行った．関数体篩法の計算の中で最も計算量を必要とするのは篩処理であるため，GF(3)[<i>x</i>] 上の篩処理についてwindow法を用いた高速化を行った．その結果，GF(3<sup><i>n</i></sup>) 上のDLP計算実験においてGrangerらが実験を行った従来の世界記録であるGF(3<sup>222</sup>)（352ビット）を大きく上回るGF(3<sup>277</sup>)（440ビット）上のDLPの計算に成功した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The η<sub><i>T</i></sub> pairing on supersingular curve over finite field GF(3<sup><i>n</i></sup>) is known as one of the most efficient pairings. The security of pairing based cryptosystems using the η<sub><i>T</i></sub> pairing is based on the difficulty of the discrete logarithm problems (DLP) over GF(3<sup><i>n</i></sup>). The most efficient algorithm for solving the DLP over finite fields of small characteristic is the function field sieve. However, few experiments on the difficulty of the DLP over GF(3<sup><i>n</i></sup>) have been reported. In this paper, we implemented the function field sieve and experimented the difficulty of the DLP over GF(3<sup><i>n</i></sup>). We present a faster implementation of the sieving in GF(3)[<i>x</i>] which is the most time-consuming step in the function field sieve. From this improvement, we succeeded solving the DLP over GF(3<sup>277</sup>) of 440 bits. This is currently the top-record bit-size of the function field sieve over GF(3<sup><i>n</i></sup>) to the best of our knowledge.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1967","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1956","bibliographicIssueDates":{"bibliographicIssueDate":"2009-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"50"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:27:12.604533+00:00","updated":"2025-01-22T01:01:46.561368+00:00"}