Asymptotic semismoothness probabilities (1996)

Cached

Download Links

by Eric Bach , René Peralta
Venue:Mathematics of computation
Citations:22 - 1 self

Active Bibliography

On intervals with few prime numbers – H. Maier, C.L. Stewart
21 Smooth numbers: computational number theory and beyond – Andrew Granville - 2008
EULER’S CONSTANT: EULER’S WORK AND MODERN DEVELOPMENTS – Jeffrey C. Lagarias - 2013
3 Fast Bounds on the Distribution of Smooth Numbers – Scott T. Parsell, Jonathan P. Sorenson - 2006
9 Order computations in generic groups – Andrew V. Sutherland - 2007
3 Arbitrarily Tight Bounds On The Distribution Of Smooth Integers – Daniel J. Bernstein - 2002
17 Factorization of the tenth and eleventh Fermat numbers – Richard P. Brent - 1996
16 On the asymptotic distribution of large prime factors – Peter Donnelly, Geoffrey Grimmett - 1993
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
3 Approximating the number of integers without large prime factors – Koji Suzuki - 2004
41 Parallel Algorithms for Integer Factorisation – Richard P. Brent
47 Some integer factorization algorithms using elliptic curves – Richard P. Brent - 1986
1 The Three-Large-Primes Variant of the Number Field Sieve – S. Cavallar, Stefania Cavallar
A PAIR OF DIFFERENCE DIFFERENTIAL EQUATIONS OF EULER-CAUCHY TYPE – David M. Bradley
7 Multidigit Modular Multiplication With The Explicit Chinese Remainder Theorem – Daniel J. Bernstein - 1995
8 MODULAR EXPONENTIATION VIA THE EXPLICIT CHINESE REMAINDER THEOREM – Daniel J. Bernstein, Jonathan, P. Sorenson
7 Security of cryptosystems based on class groups of imaginary quadratic orders – Safuat Hamdy, Bodo Möller, Fachbereich Informatik, Tu Darmstadt - 1976
3 Thue equations and the method of Chabauty-Coleman – Dino Lorenzini, Thomas J. Tucker - 2002
22 Factorization Of The Tenth Fermat Number – Richard P. Brent - 1999