Well, it seems to me that this application to Public Key Encryption means that Public Key Encryption will be useless. If prime numbers can be predicted, then the encryption is broken.
As I recall, Public Key Encryption relies on the multiplication of two very large prime numbers. As things used to stand, it was impossible to predict where those primes fall in the sequence of integers. If now there is some algorithm that can predict where those primes exist, them it would be possible to use that algorithm to break the public key. Good-bye security.
I am mathematically challenged but if it can be used to break a current key, could not the decoders go back to previous messages and break them also? If so, lots of new worriesd in the intelligence community.