Residue classes free of values of Euler’s function (1999)

Cached

Download Links

by Kevin Ford , Sergei Konyagin , Carl Pomerance
Venue:In: Gy}ory K (ed) Proc Number Theory in Progress, pp 805–812. Berlin: W de Gruyter
Citations:6 - 1 self

Active Bibliography

1 COMMON VALUES OF THE ARITHMETIC FUNCTIONS φ AND σ – Kevin Ford, Florian Luca, Carl Pomerance
16 Smooth numbers: computational number theory and beyond – Andrew Granville - 2008
Divisibility, Smoothness and Cryptographic Applications – David Naccache, Igor E. Shparlinski - 2008
2 Lower bounds for the number of smooth values of a polynomial, electronic preprint available online at http://xxx.lanl.gov/abs/math.NT/9807102 – Greg Martin - 1998
4 On values taken by the largest prime factor of shifted primes – William D. Banks, Igor E. Shparlinski
Algebraic Geometry over a field of positive characteristic – J.W.P. Hirschfeld, Luca Giuzzi
Algebraic curves and maximal arcs – Angela Aguglia, Luca Giuzzi, G. Korchmáros - 2008
On – unknown authors - 1999
Residue Classes Having Tardy Totients – John B. Friedlander, Florian Luca - 2008
unknown title – Pieter Moree - 707
5 Exceptional covers and bijections on rational points – Robert M. Guralnick, Thomas J. Tucker, Michael, E. Zieve
1 Smooth values of iterates of the Euler phi-function – Youness Lamzouri
3 Smooth Orders and Cryptographic Applications – Carl Pomerance, Igor Shparlinski - 2002
20 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
1 On a combinatorial method for counting smooth numbers in sets of integers – Ernie Croot
6 The iterated Carmichael λ function and the number of cycles of the power generator – Greg Martin, Carl Pomerance - 2005
14 Primality testing with Gaussian periods – H. W. Lenstra, Carl Pomerance - 2003
61 There are infinitely many Carmichael numbers – W. R. Alford, Andrew Granville, Carl Pomerance - 1982
56 Subquadratic-time factoring of polynomials over finite fields – Erich Kaltofen, Victor Shoup - 1998