Multiplicative Structure of Values of the Euler Function

We establish upper bounds for the number of smooth values of the Euler function. In particular, although the Euler function has a certain "smoothing" effect on its integer arguments, our results show that, in fact, most values produced by the Euler function are not smooth. We apply our results to study the distribution of "strong primes," which are commonly encountered in cryptography.