|
16
|
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
|
|
2
|
Fast Bounds on the Distribution of Smooth Numbers ⋆
– Scott T. Parsell, Jonathan P. Sorenson
|
|
|
On Positive Integers ≤x with Prime Factors ≤t log x
– Andrew Granville
|
|
|
unknown title
– Arie Leizarowitz
- 2009
|
|
|
Smoothing "Smooth" Numbers
– Andrew Granville, John B. Friedlander, John B. Friedl, Andrew Granville
|
|
9
|
Factoring estimates for a 1024-bit RSA modulus
– Arjen Lenstra, Eran Tromer, Adi Shamir, Wil Kortsmit, Bruce Dodson, James Hughes, Paul Leyl
- 2003
|
|
6
|
Order computations in generic groups
– Andrew V. Sutherland
- 2007
|
|
|
THE DISTRIBUTION OF SMOOTH NUMBERS IN ARITHMETIC PROGRESSIONS
– K. Soundararajan
- 707
|
|
1
|
On the distribution of the Euler function of shifted smooth numbers’, Preprint, 2008, (available from http://arxiv.org/abs/0810.1093
– Stefanie S. Loiperdinger, Igor E. Shparlinski
|
|
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 intervals with few prime numbers
– H. Maier, C.L. Stewart
|
|
8
|
Approximating the number of integers free of large prime factors
– Simon Hunter, Jonathan Sorenson
- 1997
|
|
|
Wild and Wooley Numbers
– Jeffrey C. Lagarias
- 2005
|
|
22
|
Asymptotic semismoothness probabilities
– Eric Bach, René Peralta
- 1996
|
|
10
|
A GMP-based implementation of Schönhage-Strassen’s large integer multiplication algorithm
– Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann
- 2007
|
