Smooth numbers: computational number theory and beyond (2008)

by Andrew Granville
Venue:ALGORITHMIC NUMBER THEORY
Citations:21 - 0 self

Active Bibliography

Divisibility, Smoothness and Cryptographic Applications – David Naccache, Igor E. Shparlinski - 2008
8 Integers, without large prime factors, in arithmetic progressions, II – Andrew Granville
5 On values taken by the largest prime factor of shifted primes – William D. Banks, Igor E. Shparlinski
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
5 Smooth Orders and Cryptographic Applications – Carl Pomerance, Igor Shparlinski - 2002
3 Approximating the number of integers without large prime factors – Koji Suzuki - 2004
15 Computing the endomorphism ring of an ordinary elliptic curve over a finite field – Gaetan Bisson, Andrew, V. Sutherland
Computational Number Theory and Algebra June 27, 2012 Lecture 20 – Lecturers Markus Bläser, An Saha, Scribe Chandan Saha
DISCRETE LOGARITHMS, DIFFIE-HELLMAN, AND REDUCTIONS – Neal Koblitz, Alfred Menezes, Igor, E. Shparlinski
Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ – Richard P. Brent - 2006
Primality testing – Richard P. Brent - 2003
3 Primality testing – Richard P - 1992
6 It Is Easy to Determine Whether a Given Integer Is – Andrew Granville - 2005
12 It Is Easy to Determine Whether a Given Integer Is Prime – Andrew Granville - 2004
2 Integer Factoring – Arjen K. Lenstra - 2000
3 Four primality testing algorithms – René Schoof - 2008
On Positive Integers ≤x with Prime Factors ≤t log x – Andrew Granville
3 Arbitrarily Tight Bounds On The Distribution Of Smooth Integers – Daniel J. Bernstein - 2002
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995