Generating a Product of Three Primes with an Unknown Factorization

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 requir the design of a new type of distributed primality test for testing that a given number is a product of three primes. We expalin the cryptographic motivation and origin of this problem.

Reference:

Dan Boneh and Jeremy Horwitz, "Generating a Product of Three Primes with an Unknown Factorization", Algorithmic Number Theory Symposium III, ANTS-III (LNCS 1423), pp. 237-251, 1998.

Copies of the paper:

PostScript PDF gzipped PostScript

Return to ...

my home page my publications

Department of Mathematics and Computer Science
Santa Clara University

Jeremy Horwitz

Last modified: Mon Dec 27 20:42:50 PST 2004