Arbitrarily Tight Bounds On The Distribution Of Smooth Integers (2002)


Download Links

by Daniel J. Bernstein
Venue:Proceedings of the Millennial Conference on Number Theory
Citations:3 - 1 self

Active Bibliography

21 Smooth numbers: computational number theory and beyond – Andrew Granville - 2008
Divisibility, Smoothness and Cryptographic Applications – David Naccache, Igor E. Shparlinski - 2008
3 Approximating the number of integers without large prime factors – Koji Suzuki - 2004
8 Integers, without large prime factors, in arithmetic progressions, II – Andrew Granville
3 Fast Bounds on the Distribution of Smooth Numbers – Scott T. Parsell, Jonathan P. Sorenson - 2006
On Positive Integers ≤x with Prime Factors ≤t log x – Andrew Granville
Smoothing "Smooth" Numbers – Andrew Granville, John B. Friedlander, John B. Friedl, Andrew Granville
Iterated logarithm approximations to the distribution of the largest prime divisor – Arie Leizarowitz - 2009
12 Factoring estimates for a 1024-bit RSA modulus – Arjen Lenstra, Eran Tromer, Adi Shamir, Wil Kortsmit, Bruce Dodson, James Hughes, Paul Leyland - 2003
9 Order computations in generic groups – Andrew V. Sutherland - 2007
Index Calculus Method based on Smooth Numbers of ±1 over Z ∗ p – R. Padmavathy, Chakravarthy Bhagvati - 2010
2 The Number of Relations in the Quadratic Sieve Algorithm – H. Boender, Henk Boender - 1996
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
On ideals free of large prime factors – Eira J. Scourfield - 2004
On intervals with few prime numbers – H. Maier, C.L. Stewart
9 Approximating the number of integers free of large prime factors – Simon Hunter, Jonathan Sorenson - 1997
Discrete logarithms: The past and the future – Andrew Odlyzko Att, Andrew Odlyzko - 2000
9 Smooth ideals in hyperelliptic function fields – Andreas Enge, Andreas Stein