Sciweavers

39 search results - page 1 / 8
» A note on the distribution of the number of prime factors of...
Sort
View
IPL
2008
82views more  IPL 2008»
13 years 7 months ago
A note on the distribution of the number of prime factors of the integers
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...
Aravind Srinivasan
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 7 months ago
A Note on Integer Factorization Using Lattices
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...
Antonio Ignacio Vera
MOC
2010
13 years 2 months ago
The period of the Bell numbers modulo a prime
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...
ANTS
2006
Springer
94views Algorithms» more  ANTS 2006»
13 years 11 months ago
Fast Bounds on the Distribution of Smooth Numbers
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...
Scott T. Parsell, Jonathan Sorenson
BIBE
2004
IEEE
107views Bioinformatics» more  BIBE 2004»
13 years 11 months ago
Fast Parallel Molecular Algorithms for DNA-based Computation: Factoring Integers
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...
Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo