Generating RSA moduli with a predetermined portion
Lenstra, Arjen K. · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 1998
This paper reviews and generalizes a method to generate RSA moduli with a predetermined portion. The potential advantages of the resulting methods are discussed. Both the storage and the computational requirements of the RSA cryptosystem can be considerably reduced. The constructions are as efficient as generation of regular RSA moduli, and the resulting moduli do not seem to offer less security than regular RSA moduli