Anzeige
Erschienen in:
2002 | OriginalPaper | Buchkapitel
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products
verfasst von : Joy Algesheimer, Jan Camenisch, Victor Shoup
Erschienen in: Advances in Cryptology — CRYPTO 2002
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 one to distributively compute shared RSA keys, where the modulus is the product of two safe primes, much more efficiently than was previously known.