arXiv · 1303.5226
Algorithm for factoring some RSA and Rabin moduli
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.
Explore related subjects
Keep this discovery
Omar Khadir. 2013-03-21. Algorithm for factoring some RSA and Rabin moduli. https://arxiv.org/abs/1303.5226
Cite the original work for its findings. Save a collection to share your selection of sources.