The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of [11], as well as new pro...
We discuss the numbers in the title, and in particular whether the minimum period of the Bell numbers modulo a prime p can be a proper divisor of Np = (pp - 1)/(p - 1). It is known...
Peter L. Montgomery, Sangil Nahm, Samuel S. Wagsta...
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
The RSA public-key cryptosystem is an algorithm that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form...