# Why are cube and square roots of primes used as SHA constants?

Do square or cube roots have properties that make them a better choice over, for example, the primes themselves? Or is it arbitrary - would random numbers work as effectively?