Experimental performance of shared RSA modulus generation

Rebecca N. Wright, Sara Spalding

Research output: Contribution to conferencePaper

Abstract

The generation and performance of the shared RSA modulus were experimentally evaluated. A two-party version of the shared modulus generation part of the Boneh-Franklin protocol was implemented. The computational overhead of the two-party protocol was not prohibitive. For a 1024-bit modulus and a good choice of certain parameters, the implementation took approximately 13 minutes to generate a shared modulus. Even at a small number of distributed trial divisions, the two-party protocol yielded a significant increase in performance over doing none at all, while the number of local trial divisions is less important.

Original languageEnglish (US)
StatePublished - Jan 1 1999
Externally publishedYes
EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Duration: Jan 17 1999Jan 19 1999

Other

OtherProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
CityBaltimore, MD, USA
Period1/17/991/19/99

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Experimental performance of shared RSA modulus generation'. Together they form a unique fingerprint.

  • Cite this

    Wright, R. N., & Spalding, S. (1999). Experimental performance of shared RSA modulus generation. Paper presented at Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, .