Efficient generation of shared RSA keys.
We describe efficient techniques for a number of parties to jointly generate 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...
| Published in: | Journal of the ACM 48, 4 (2001). |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Subjects: |