Two party RSA key generation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

100 Scopus citations

Abstract

We present a protocol for two parties to generate an RSA key in a distributed manner. At the end of the protocol the public key: a modulus N = PQ, and an encryption exponent e are known to both parties. Individually, neither party obtains information about the decryption key d and the prime factors of N: P and Q. However, d is shared among the parties so that threshold decryption is possible.

Original languageEnglish
Title of host publicationAdvances in Cryptology – CRYPTO 1999 - 19th Annual International Cryptology Conference, Proceedings
EditorsMichael Wiener
PublisherSpringer Verlag
Pages116-129
Number of pages14
ISBN (Print)3540663479, 9783540663478
DOIs
StatePublished - 1 Jan 1999
Externally publishedYes
Event19th Annual International Cryptology Conference, CRYPTO 1999 - Santa Barbara, United States
Duration: 15 Aug 199919 Aug 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1666
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th Annual International Cryptology Conference, CRYPTO 1999
Country/TerritoryUnited States
CitySanta Barbara
Period15/08/9919/08/99

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Two party RSA key generation'. Together they form a unique fingerprint.

Cite this