On RSA Moduli with Almost Half of the Bits Prescribed

Details On RSA Moduli with Almost Half of the Bits Prescribed On RSA Moduli with Almost Half of the Bits Prescribed

2007-09-17

arxiv.org/abs/0709.2704v1

Mathematics

Number Theory

Scientific paper

We show that using character sum estimates due to H. Iwaniec leads to an improvement of recent results about the distribution and finding RSA moduli $M=pl$, where $p$ and $l$ are primes, with prescribed bit patterns. We are now able to specify about $n$ bits instead of about $n/2$ bits as in the previous work. We also show that the same result of H. Iwaniec can be used to obtain an unconditional version of a combinatorial result of W. de Launey and D. Gordon that was originally derived under the Extended Riemann Hypothesis.

Affiliated with

Also associated with

No associations

Rating

On RSA Moduli with Almost Half of the Bits Prescribed 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 On RSA Moduli with Almost Half of the Bits Prescribed, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On RSA Moduli with Almost Half of the Bits Prescribed will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379282