Factoring multi power RSA moduli with a class of secret exponents
Open Access
- 1 December 2015
- journal article
- research article
- Published by Springer Nature in Acta Universitatis Sapientiae, Informatica
- Vol. 7 (2) , 143-150
Abstract
In this paper, we consider the RSA variant based on the key equation ed ≡ 1 (mod φ(N)) where N = prq, r ≥ 2. We show that if the secret exponent d is close to any multiple of the prime factor p or its powers, then it is possible to factor N in polynomial time in log N.Keywords
This publication has 4 references indexed in Scilit:
- Cryptanalysis of RSA with Small Prime DifferenceApplicable Algebra in Engineering, Communication and Computing, 2002
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975
- On factoring large numbersBulletin of the American Mathematical Society, 1931