Algorithm for factoring some RSA and Rabin moduli

From MaRDI portal



Abstract: In this paper we present a new efficient algorithm for factoring the RSA and the Rabin moduli in the particular case when the difference between their two prime factors is bounded. As an extension, we also give some theoretical results on factoring integers.












This page was built for publication: Algorithm for factoring some RSA and Rabin moduli

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637783)