Counting RSA-integers

Details Counting RSA-integers Counting RSA-integers

2008-01-09

arxiv.org/abs/0801.1451v1

Mathematics

Number Theory

to appear in Results in Mathematics, 5 pages, with the view of possible interest by cryptographers we aimed for a very short p

Scientific paper

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 n<=x that are of the form n=pq with p and q primes such that p1 asymptotically equal to c_r*x*log^{-2}x for some constant c_r>0. Here we prove this and show that c_r=2log r.

Affiliated with

Also associated with

No associations

Rating

Counting RSA-integers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting RSA-integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting RSA-integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-670263