I used this c program to calculate the private key.
These can be calculated, but this is not easy so I will look them up ). Now we have to find the factors $(p,q)$ of the modulus $n$.
To get the corresponding decimal values we have to convert the hex-values. The second Integer is the modulo and the last int is the exponent. These values can be extracted out of the public key file.
First we need to gather some information like modulo $n$ and the exponent $e$. If you want to know how RSA works, take a look at one of the million blog posts out there. So RSA is not bad, but please use a suitable key size.įor this blog post it’s not important, why RSA is secure and works, it’s just a tutorial how to calculate a private key if it get’s lost (will just work for unsecure keys indeed) or to demonstrate that small key sizes are unsecure. Why weak? Because a (only) 268-bit key was used for encryption. I had to decrypt a weak RSA encrypted message.
0 kommentar(er)
