Member-only story
TryHackMe | Breaking RSA | WriteUp
Hop in and break poorly implemented RSA using Fermat’s factorization algorithm
↓↓↓ Click here and earn $5 TryHackMe credit ↓↓↓
Find the room here: https://tryhackme.com/room/breakrsa
Task 1 Capture the flag
A brief overview of RSA
The security of RSA relies on the practical difficulty of factoring the product of two large prime numbers, the “factoring problem”. RSA key pair is generated using 3 large positive integers -
e = A constant, usually 65537
n = Known as the modulus of public-private key pair. It is a product of 2 large random prime numbers, p and q.
