3

Approximating the number of integers without large prime factors
– Koji Suzuki
 2004

21

Smooth numbers: computational number theory and beyond
– Andrew Granville
 2008

3

Arbitrarily Tight Bounds On The Distribution Of Smooth Integers
– Daniel J. Bernstein
 2002

22

Asymptotic semismoothness probabilities
– Eric Bach, René Peralta
 1996


Divisibility, Smoothness and Cryptographic Applications
– David Naccache, Igor E. Shparlinski
 2008

9

Order computations in generic groups
– Andrew V. Sutherland
 2007


Iterated logarithm approximations to the distribution of the largest prime divisor
– Arie Leizarowitz
 2009


A PAIR OF DIFFERENCE DIFFERENTIAL EQUATIONS OF EULERCAUCHY TYPE
– David M. Bradley


Index Calculus Method based on Smooth Numbers of ±1 over Z ∗ p
– R. Padmavathy, Chakravarthy Bhagvati
 2010


Multivariate Diophantine equations with
– J. h. Evertse, P. Moree, C. L. Stewart, R. Tijdeman

3

Multivariate Diophantine equations with many solutions
– J.H. Evertse, P. Moree, C.L. Stewart, R. Tijdeman
 2001


On Positive Integers ≤x with Prime Factors ≤t log x
– Andrew Granville

9

Approximating the number of integers free of large prime factors
– Simon Hunter, Jonathan Sorenson
 1997

7

Security of cryptosystems based on class groups of imaginary quadratic orders
– Safuat Hamdy, Bodo Möller, Fachbereich Informatik, Tu Darmstadt
 1976


On intervals with few prime numbers
– H. Maier, C.L. Stewart

16

On the asymptotic distribution of large prime factors
– Peter Donnelly, Geoffrey Grimmett
 1993

15

Efficient blind signatures without random oracles
– Maciej Koprowski, Bodgan Warinschi
 2004

9

Distribution of the Number of Factors in Random Ordered Factorizations of Integers
– HsienKuei Hwang
 1998


EULER’S CONSTANT: EULER’S WORK AND MODERN DEVELOPMENTS
– Jeffrey C. Lagarias
 2013
