Algorithm for factoring some RSA and Rabin moduli
Cryptography and Security
2013-03-22 v1 Number Theory
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
Cite
@article{arxiv.1303.5226,
title = {Algorithm for factoring some RSA and Rabin moduli},
author = {Omar Khadir},
journal= {arXiv preprint arXiv:1303.5226},
year = {2013}
}