Algorithm for factoring some RSA and Rabin moduli

TL;DR

This paper introduces an efficient algorithm for factoring RSA and Rabin moduli when their prime factors are close, along with theoretical insights into integer factorization.

Contribution

The paper presents a novel algorithm specifically targeting RSA and Rabin moduli with small prime differences, and extends theoretical understanding of integer factorization.

Findings

Algorithm successfully factors moduli with small prime differences

Provides theoretical bounds for factoring integers

Enhances understanding of special cases in integer factorization

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.