Approximately counting semismooth integers


An integer <i>n</i> is (<i>y,z</i>)-semismooth if <i>n=pm</i> where <i>m</i> is an integer with all prime divisors &#8805; <i>y</i> and <i>p</i> is 1 or a prime &#8805; <i>z</i>. Large quantities of semismooth integers are utilized in modern integer factoring algorithms, such as the number field sieve, that incorporate the so-called <i>large prime</i… (More)
DOI: 10.1145/2465506.2465933


6 Figures and Tables