Implementing shared generation of RSA keys

Previously the concept of sharing the secure RSA keys among various users in a distributed fashion was proposed for implementation through a trusted dealer. But to find a trusted dealer, who would keep the secret alive. has been the toughest challenge. Our implementation concentrates on the effectiveness of die algorithm by providing the much-needed security to the generation and maintenance of keys without using a third party dealer. We describe efficient techniques for a number of parties to jointly generate and share an RSA key. At the end of the protocol an RSA modulus N = PQ is publicly known. None of the parties know the factorization of N. In addition. a public encryption exponent is publicly known and each party holds a share of the private exponent that enables threshold decryption. Our protocols are efficient in computation and communication.