Why are huge prime numbers important in cryptography?
Preposterously large primes are not useful for cryptography in and of themselves, but the tools and techniques developed to find them (such as massively parallel distributed computing, algorithms that can efficiently confirm primality, etc) are important for cryptography.  The prizes are meant to spur innovation in those areas.  See e.g. https://www.eff.org/awards/coop