Lower Bounds For The Number Of Smooth Values Of A Polynomial (1998)

by Greg Martin
Citations:3 - 1 self

Active Bibliography

32 Smooth numbers: computational number theory and beyond – Andrew Granville - 2008
Divisibility, Smoothness and Cryptographic Applications – David Naccache, Igor E. Shparlinski - 2008
Anatomy of Integers and Cryptography – Igor Shparlinski - 2008
13 An asymptotic formula for the number of smooth values of a polynomial – Greg Martin - 1999
313 Analytic Number Theory – Henryk Iwaniec, Emmanuel Kowalski - 2004
216 Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack – Ronald Cramer, Victor Shoup - 2001
172 Signature Schemes Based on the Strong RSA Assumption – Ronald Cramer, Victor Shoup - 1998
24 The distribution of totients – Kevin Ford - 1998
6 On values taken by the largest prime factor of shifted primes – W D Banks, I E Shparlinski