Photo by Alex Motoc on Unsplash

How To Crack The Near Impossible When There’s a Weakness … Meet Fermat’s Attack on RSA

With RSA, we generate two random prime numbers (p and q) with the same number of bits. This produces a modulus (N). If the modulus is 512 bits and more, it will take a long time to factorize the modulus, and is extremely expensive. But, there is an attack that is possible when the two prime numbers are fairly close to each other. This is…