Generating Shared RSA Parameters for Two Communicating Parties

• Item type: Journal(1)
• 公開日: 2000-08-15
• タイトル: Generating Shared RSA Parameters for Two Communicating Parties
• タイトル / 言語: en
• タイトル: Generating Shared RSA Parameters for Two Communicating Parties
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 特集：情報セキュリティの理論と応用
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• その他タイトル / その他のタイトル: 暗号化
• 著者所属: Department of Computer Science Graduate School of Science and Technology Keio University
• 著者所属: Department of Computer Science Graduate School of Science and Technology Keio University
• 著者所属: Department of Computer Science Graduate School of Science and Technology Ke
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, Graduate School of Science and Technology, Keio University
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, Graduate School of Science and Technology, Keio University
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, Graduate School of Science and Technology, Keio University
• 著者名: AriMoesriamiBarmawi; Shingo, Takada; Norihisa, Doi
• 著者名(英): Ari, MoesriamiBarmawi; Shingo, Takada; Norihisa, Doi
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: The RSA encryption system is a widely used cryptographic protocol requiring the generation of several parameters.Boneh and Franklin proposed a protocol to efficiently generate shared RSA parameters but it needs a third party.Cocks Poupard-Stern and Gilboa proposed improvements of Boneh-Franklin's protocolthat do not need the help of a third party but their protocols have a large computational complexity.We propose a protocol for generating shared RSA parameters for two communicating parties.Our protocol does not need the help of a third party and has less computationalcomplexity than the protocols proposed by Cocks Poupard-Stern and Gilboa.We assume that before both parties execute the protocol they agree on the size of the modulus number which will be generated andthe hash function that will be used.Our protocol generates a public modulus number without the parties knowingthe factors of that number.Although the encryption key is publicly known each party holds only a part of the key that is used to decrypt the received messages.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: The RSA encryption system is a widely used cryptographic protocol,requiring the generation of several parameters.Boneh and Franklin proposed a protocol to efficiently generate shared RSA parameters,but it needs a third party.Cocks,Poupard-Stern and Gilboa proposed improvements of Boneh-Franklin's protocolthat do not need the help of a third party,but their protocols have a large computational complexity.We propose a protocol for generating shared RSA parameters for two communicating parties.Our protocol does not need the help of a third party and has less computationalcomplexity than the protocols proposed by Cocks,Poupard-Stern and Gilboa.We assume that before both parties execute the protocol,they agree on the size of the modulus number which will be generated andthe hash function that will be used.Our protocol generates a public modulus number without the parties knowingthe factors of that number.Although the encryption key is publicly known,each party holds only a part of the key that is used to decrypt the received messages.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 41, 号 8, p. 2068-2079, 発行日 2000-08-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764