Experimenting with Distributed Generation of RSA Keys

Abstract : Threshold cryptography allows a message to be enciphered through the cooperation of several entities among which no one knows the whole secret key. However, if the key pair is generated using an usual centralized algorithm, then there is an entity which knows the whole secret key. In this paper, we present an implementation of a distributed algorithm to generate RSA keys, previously proposed by Boneh and Franklin. Using this implementation, we analyze how many parties can jointly generate the key and we show that a few dozens of ordinary nodes distributed worldwide can achieve this task.
Document type :
Conference papers
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00423326
Contributor : Myriam Andrieux <>
Submitted on : Friday, October 9, 2009 - 2:53:47 PM
Last modification on : Tuesday, February 26, 2019 - 3:26:08 PM

Identifiers

  • HAL Id : hal-00423326, version 1

Collections

Citation

Thierry Congos, François Lesueur. Experimenting with Distributed Generation of RSA Keys. 5th International Workshop on Security and Trust Management (STM), Sep 2009, Saint-Malo, France. ⟨hal-00423326⟩

Share

Metrics

Record views

63