Algorithm for factoring some RSA and Rabin moduli
arXiv:1303.5226v19 citations
Originality Incremental advance
AI Analysis
This work addresses a specific cryptographic vulnerability for security applications, but it is incremental as it focuses on a bounded-difference scenario rather than general factoring.
The paper tackles the problem of factoring RSA and Rabin moduli when the difference between their prime factors is bounded, presenting a new efficient algorithm for this case and extending it with theoretical results on integer factoring.
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.