On the Decentralized Generation of theRSA Moduli in Multi-Party Settings

TL;DR

This paper introduces an efficient decentralized multi-party computation algorithm for generating RSA moduli, addressing the limitations of existing methods that are either costly or restricted to two-party scenarios.

Contribution

It presents a novel multi-party algorithm for RSA modulus generation that is both efficient and scalable beyond two-party settings.

Findings

The algorithm reduces computational costs compared to previous methods.

It enables secure RSA modulus generation without a trusted centralized authority.

The approach is suitable for distributed cryptographic applications.

Abstract

RSA cryptography is still widely used. Some of its applications (e.g., distributed signature schemes, cryptosystems) do not allow the RSA modulus to be generated by a centralized trusted entity. Instead, the factorization must remain unknown to all the network participants. To this date, the existing algorithms are either computationally expensive, or limited to two-party settings. In this work, we design a decentralized multi-party computation algorithm able to generate efficiently the RSA modulus.