On RSA moduli with almost half of the bits prescribed | Macquarie University ResearchOnline

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/146689

16 Visitors

19 Hits

0 Downloads

Title: On RSA moduli with almost half of the bits prescribed
Related: Discrete applied mathematics, Vol. 156, Issue 16, (2008), p.3150-3154
DOI: 10.1016/j.dam.2007.12.012
Publisher: Elsevier BV
Date: 2008
FoR/RFCD Code(s): 010200 Applied Mathematics
Author/Creator: Graham, Sidney W
Author/Creator: Shparlinski, Igor E
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.
Description: 5 page(s)
Subject Keyword: 010200 Applied Mathematics
Subject Keyword: RSA
Subject Keyword: Bit pattern
Subject Keyword: Sparse integer
Subject Keyword: Smooth integer
Subject Keyword: Character sum
Subject Keyword: Hadamard matrices
Resource Type: journal article
Organisation: Macquarie University. Dept. of Computing

Macquarie University ResearchOnline