Robust protocol for generating shared RSA parameters

Ari Moesriami Barmawi, Shingo Takada, Norihisa Doi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


This paper describes how n parties can jointly generate the parameters for the RSA encryption system while being robust to prevent attacks from cheaters and malicious parties. The proposed protocol generates a public modulus number, without the parties knowing the factorization of that number. Our proposed protocol is similar to that of Boneh-Franklin's protocol. However, when there are two communicating parties our proposed protocol does not need the help of a third party. By using our proposed protocol, we can detect the presence of malicious parties and cheaters among the authorized user. An analysis shows that our proposed protocol has less computational complexity than the protocol of Frankel-MacKenzie-Yung.

Original languageEnglish
Title of host publicationCryptography and Coding - 7th IMA International Conference, Proceedings
EditorsMichael Walker
PublisherSpringer Verlag
Number of pages10
ISBN (Print)354066887X, 9783540668879
Publication statusPublished - 1999
Event7th IMA International Conference on Cryptography and Coding, 1999 - Cirencester, United Kingdom
Duration: 1999 Dec 201999 Dec 22

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other7th IMA International Conference on Cryptography and Coding, 1999
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Robust protocol for generating shared RSA parameters'. Together they form a unique fingerprint.

Cite this