On the Decentralized Generation of theRSA Moduli in Multi-Party Settings
This work solves the challenge of secure RSA modulus generation for applications like distributed signatures and cryptosystems in multi-party networks, representing an incremental improvement over existing methods.
The paper tackles the problem of generating RSA moduli in decentralized multi-party settings without a trusted entity, and presents a new algorithm that achieves efficient generation, addressing computational cost and scalability limitations.
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.