Algorithm for factoring some RSA and Rabin moduli
Author:
- 1 October 2008
- journal article
- research article
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 11 (5) , 537-543
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 7 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 Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve AlgorithmSIAM Journal on Computing, 1988
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975