{"updated":"2025-01-21T23:33:48.230893+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00070175","sets":["1:5955:5961"]},"path":["5961"],"owner":"13","recid":"70175","title":["素因数分解技術の進展-RSA-768 の分解達成への道のり-"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-08-15"},"_buckets":{"deposit":"54bf77b8-db83-4547-9dde-82ce7f6c8157"},"_deposit":{"id":"70175","pid":{"type":"depid","value":"70175","revision_id":0},"owners":[13],"status":"published","created_by":13},"item_title":"素因数分解技術の進展-RSA-768 の分解達成への道のり-","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"素因数分解技術の進展-RSA-768 の分解達成への道のり-"},{"subitem_title":"Advances in Integer Factoring Technique - The Way to Factor RSA-768","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"解説","subitem_subject_scheme":"Other"}]},"item_type_id":"1","publish_date":"2010-08-15","item_1_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"日本電信電話（株）"}]},"item_1_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nippon Telegraph and Telephone 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/70175/files/IPSJ-MGN510820.pdf"},"date":[{"dateType":"Available","dateValue":"2012-08-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MGN510820.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"74d61a9a-8515-4834-9848-2b4e7d2ed74a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2010 by the Information Processing Society of Japan"}]},"item_1_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"青木, 和麻呂"}],"nameIdentifiers":[{}]}]},"item_1_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazumaro, AOKI","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_1_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116625","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"article"}]},"item_1_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"2009年12月12日（日本時間では13日），RSA-768と呼ばれる768ビットの合成数が素因数分解された．特別な形の合成数では以前に，より大きいものが素因数分解されているが，RSA公開鍵暗号に利用される大きな2素数の積の素因数分解に対しては，世界記録更新である．この記録は瑞，日，独，仏，蘭の5カ国の機関の研究者の共同作業の成果であり，筆者もこの作業に参加した．この素因数分解では，一般数体篩法（いっぱんすうたいふるいほう； GNFS）と呼ばれる代数的整数論を応用した方法が使われた．数体篩法を実際に実現するためには，概念的なアルゴリズムばかりではなく，細部の実装や計算資源の配分などが効率の重要な鍵を握っている．本稿では，数体篩法の概略を説明し，各ステップでの実装や計算機運用の問題点を紹介する．最後に，従来よりRSA公開鍵暗号で1024ビットの公開鍵の新規利用は推奨できないことが指摘されていたが，今回768ビットの合成数が現実に素因数分解されたことはこの指摘を補強するものであることを付け加えておく．","subitem_description_type":"Other"}]},"item_1_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1038","bibliographic_titles":[{"bibliographic_title":"情報処理"}],"bibliographicPageStart":"1030","bibliographicIssueDates":{"bibliographicIssueDate":"2010-08-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"51"}]},"relation_version_is_last":true,"weko_creator_id":"13"},"created":"2025-01-18T23:29:27.923335+00:00","id":70175,"links":{}}