Cryptology ePrint Archive: Report 2002/029

Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products

Joy Algesheimer and Jan Camenisch and Victor Shoup

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.

Category / Keywords: RSA, safe primes, threshold cryptography, distributed primality test

Date: received 6 Mar 2002, last revised 6 Mar 2002

Contact author: jca at zurich ibm com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20020306:121100 (All versions of this report)

Short URL: ia.cr/2002/029

Discussion forum: Show discussion | Start new discussion