Converse of RSA

from blog John D. Cook, | ↗ original
The security of RSA encryption depends on the difficulty of factoring the product of two large primes. If you can factor large numbers efficiently, you can break RSA. But if can break RSA, can you factor large numbers? Sorta. It’s conceivable that there is a way to break RSA encryption without having to recover the […] The post Converse of RSA...