Welcome to the resource topic for 2012/336
Title:
RSA modulus generation in the two-party case
Authors: Gerald Gavin
Abstract:In this paper, secure two-party protocols are provided in order to securely generate a random k-bit RSA modulus n keeping its factorization secret. We first show that most existing two-party protocols based on Boneh’s test are not correct: an RSA modulus can be output in the malicious case. Recently, Hazay et al. proposed the first proven secure protocol against any polynomial active adversary. However, their protocol is very costly: several hours are required to output a 1024-bit RSA modulus on a standard platform. In this paper, we propose an other approach consisting of post-processing efficient existing Boneh’s based protocols. The running time of this post-processing can be neglected with respect to the running time of the whole protocol.
ePrint: https://eprint.iacr.org/2012/336
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .