Are there any efficient algorithms for computing the [Euler totient function][1]? (It's easy if you can factor, but factoring is hard.)

Is it the case that computing this is as hard as factoring?

  [1]: http://en.wikipedia.org/wiki/Euler%27s_totient_function