In the 1978 RSA paper, it is recommended, among other things, to choose primes $p$ such that $(p-1)$ has a large prime factor $u$. This was motivated by Pollard's p-1 algorithm. Further, the authors state:
Additional security is provided by ensuring that $(u−1)$ also has a large prime factor.
What was the motivation for that?