{"links":{},"id":32515,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032515","sets":["1164:2592:2700:2701"]},"path":["2701"],"owner":"1","recid":"32515","title":["高速アルゴリズムを用いた RSA 暗号方式"],"pubdate":{"attribute_name":"公開日","attribute_value":"1992-11-20"},"_buckets":{"deposit":"b9de63e4-b133-4f1d-8eab-edc59c77c77a"},"_deposit":{"id":"32515","pid":{"type":"depid","value":"32515","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"高速アルゴリズムを用いた RSA 暗号方式","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"高速アルゴリズムを用いた RSA 暗号方式"},{"subitem_title":"On RSA - type Cryptosystem with Fast Encoding and Decoding Algorithms","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1992-11-20","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 Engineering and Design Kyoto Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering and Design Kyoto Institute of 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/32515/files/IPSJ-AL92030017.pdf"},"date":[{"dateType":"Available","dateValue":"1994-11-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL92030017.pdf","filesize":[{"value":"836.2 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"69b2ea6c-2de6-419d-934e-77235d2e838f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1992 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"佐竹, 賢治"},{"creatorName":"笠原, 正雄"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kenji, Satake","creatorNameLang":"en"},{"creatorName":"Masao, Kasahara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"情報通信技術の発展に伴い、情報ネットワーク上のセキュリティ確保の問題が益々重要視されるようになり、そのため暗号技術が単に情報通信の分野にとどまらず、電子送金、ショッピング、レジャー等の様々な身近な分野で使用されつつある。現在、公開鍵暗号、なかでもRSA暗号が多大の注目を集めているが、暗号化、復号化にべき乗演算及び剰余演算を繰り返し使用するため計算時間が膨大なものになるとう欠点を有している。本稿では法n（つの素数p、qの積）を特別な形に設定したRSA暗号を提案する。このように法nをある特別な形に設定した場合、安全性が若干犠牲になると考えられるので従来方式と同様の安全性を確保するため、法nを若干大きくしている。本稿ではRSA型暗号の暗号化、復号化の計算時間短縮方法について詳細に述べるとともに、シミュレーション実験によってその効果を確かめている。また、専用ハードウェアを構成するという立場から考察を加えている。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper presents the fast encoding and decoding algorithms using a particular form of divisor n for RSA-type cryptosystem. Our proposed scheme requires only afew steps for exponentiation modulo n, while the conventional schemes needs almost a hundred steps. Finally, we have discussed the bounds of caluculation required when our acheme is realized by a hardware.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"159","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"153","bibliographicIssueDates":{"bibliographicIssueDate":"1992-11-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"94(1992-AL-030)","bibliographicVolumeNumber":"1992"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:35.085225+00:00","updated":"2025-01-22T16:08:38.700969+00:00"}