39 search results - page 1 / 8 » A note on the distribution of the number of prime factors of... |
IPL
2008
13 years 4 months ago
2008
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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
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...
MOC
2010
12 years 11 months ago
2010
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...
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
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...
BIBE
2004
IEEE
13 years 8 months ago
2004
IEEE
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...