9 research outputs found

    Approximately counting semismooth integers

    Full text link
    An integer nn is (y,z)(y,z)-semismooth if n=pmn=pm where mm is an integer with all prime divisors y\le y and pp is 1 or a prime z\le z. arge quantities of semismooth integers are utilized in modern integer factoring algorithms, such as the number field sieve, that incorporate the so-called large prime variant. Thus, it is useful for factoring practitioners to be able to estimate the value of Ψ(x,y,z)\Psi(x,y,z), the number of (y,z)(y,z)-semismooth integers up to xx, so that they can better set algorithm parameters and minimize running times, which could be weeks or months on a cluster supercomputer. In this paper, we explore several algorithms to approximate Ψ(x,y,z)\Psi(x,y,z) using a generalization of Buchstab's identity with numeric integration.Comment: To appear in ISSAC 2013, Boston M

    An Algorithm for Ennola's Second Theorem and Counting Smooth Numbers in Practice

    Full text link
    Let Ψ(x,y)\Psi(x,y) count the number of positive integers nxn\le x such that every prime divisor of nn is at most yy. Given inputs xx and yy, what is the best way to estimate Ψ(x,y)\Psi(x,y)? We address this problem in three ways: with a new algorithm to estimate Ψ(x,y)\Psi(x,y), with a performance improvement to an established algorithm, and with empirically based advice on how to choose an algorithm to estimate Ψ\Psi for the given inputs. Our new algorithm to estimate Ψ(x,y)\Psi(x,y) is based on Ennola's second theorem [Ennola69], which applies when y0y0. It takes O(y2/logy)O(y^2/\log y) arithmetic operations of precomputation and O(ylogy)O(y\log y) operations per evaluation of Ψ\Psi. We show how to speed up Algorithm HT, which is based on the saddle-point method of Hildebrand and Tenenbaum [1986], by a factor proportional to loglogx\log\log x, by applying Newton's method in a new way. And finally we give our empirical advice based on five algorithms to compute estimates for Ψ(x,y)\Psi(x,y).The challenge here is that the boundaries of the ranges of applicability, as given in theorems, often include unknown constants or small values of ϵ>0\epsilon>0, for example, that cannot be programmed directly

    Divisibility, Smoothness and Cryptographic Applications

    Get PDF
    This paper deals with products of moderate-size primes, familiarly known as smooth numbers. Smooth numbers play a crucial role in information theory, signal processing and cryptography. We present various properties of smooth numbers relating to their enumeration, distribution and occurrence in various integer sequences. We then turn our attention to cryptographic applications in which smooth numbers play a pivotal role

    Bounding smooth integers (extended abstract)

    No full text

    Bounding smooth integers (extended abstract)

    No full text
    corecore