Given a positive integer n, find largest integer a such that a*a divides n.
If you know the factorization of n, it's fairly trivial. The question is, can it be done asymptotically faster than factoring n using the best known method? Is there any polynomial algorithm? (polynomial in bit-length of n)
For example with Pollard's rho algorithm for factorization it would run in O(n^(1/4)), but I'm looking for better.