Counting RSA-integers
Andreas Decker, Pieter Moree · arXiv (Cornell University) · 2008
In the RSA cryptosystem integers of the form n=p.q with p and q primes of comparable size (`RSA-integers') play an important role. It is a folklore result of cryptographers that C_r(x), the number of integers n0. Here we prove this and show that c_r=2log r.