No. PGP is not the same as homomorphic encryption. Homomorphic encryption doesn’t depend on factoring in any way. Note also, that proving the Riemann hypothesis doesn’t magically give you any way to factor numbers quickly. You may be confusing this with P=NP. If such an AI had an algorithm that efficiently solved some NP complete problem then there would be a possible danger. But that’s a very different claim.
It might help for you to read up a bit on theoretical computer science since it sounds like you’ve adopted certain misconceptions that one might get at if one has simply read popularizations with minimal math content.
No. PGP is not the same as homomorphic encryption. Homomorphic encryption doesn’t depend on factoring in any way. Note also, that proving the Riemann hypothesis doesn’t magically give you any way to factor numbers quickly. You may be confusing this with P=NP. If such an AI had an algorithm that efficiently solved some NP complete problem then there would be a possible danger. But that’s a very different claim.
It might help for you to read up a bit on theoretical computer science since it sounds like you’ve adopted certain misconceptions that one might get at if one has simply read popularizations with minimal math content.