Generating a Product of Three Primes with an Unknown Factorization (1998)
Cached
Download Links
- [crypto.stanford.edu]
- [www.stanford.edu]
- [crypto.stanford.edu]
- [theory.stanford.edu]
- [theory.stanford.edu]
- DBLP
Other Repositories/Bibliography
by
Dan Boneh
,
Jeremy Horwitz
| Venue: | Proc. 3rd Algorithmic Number Theory Symposium (ANTS-III |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Boneh98generatinga,
author = {Dan Boneh and Jeremy Horwitz},
title = {Generating a Product of Three Primes with an Unknown Factorization},
booktitle = {Proc. 3rd Algorithmic Number Theory Symposium (ANTS-III},
year = {1998},
pages = {237--251},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe protocols for three or more parties to jointly generate a composite N = pqr which is the product of three primes. After our protocols terminate N is publicly known, but neither party knows the factorization of N . Our protocols require the design of a new type of distributed primality test for testing that a given number is a product of three primes. We explain the cryptographic motivation and origin of this problem.
