Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products (2002)
| Content Provider | CiteSeerX |
|---|---|
| Author | Shoup, Victor Algesheimer, Joy |
| Abstract | We present a new protocol for efficient distributed computation modulo a shared secret. We further present a protocol to distributively generate a random shared prime or safe prime that is much more efficient than previously known methods. This allows to distributively compute shared RSA keys, where the modulus is the product of two safe primes, much more efficiently than was previously known. |
| File Format | |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Shared Secret Efficient Computation Modulo Shared Safe-prime Product New Protocol Rsa Key Safe Prime |
| Content Type | Text |
| Resource Type | Proceeding |
