On RSA Moduli with Almost Half of the Bits Prescribed
| dc.creator | Graham, Sidney W. | |
| dc.creator | Shparlinski, Igor E. | |
| dc.date | 2007-09-17 | |
| dc.date.accessioned | 2026-07-07T08:30:07Z | |
| dc.date.available | 2026-07-07T08:30:07Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0709.2704 | |
| dc.identifier | http://arxiv.org/abs/0709.2704 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/138163 | |
| dc.subject | Number Theory | |
| dc.subject | 11A63, 11L40, 11N25, 94A60 | |
| dc.title | On RSA Moduli with Almost Half of the Bits Prescribed | |
| dc.type | text |