I just looked this up on Wonkipedia and it says they use functions in the form: φ(n) = (p − 1)(q − 1). This would explain why the algorithms are useful for second order computations. That's my best guess on the surface anyway, as I've not looked into much of this stuff.