Algorithm for factoring some RSA and Rabin moduli
Author:
Preprint
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.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and FactoringJournal of Cryptology, 2006
- Selecting Cryptographic Key SizesJournal of Cryptology, 2001
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978