jrmdev / ctf-writeups Goto Github PK

Hi
When I did this problem, I managed to factorize n to get p and q, and also to generate a private key pem.
But, I don't know how to apply this pem to decrypt the encrypted data with tools, OpenSSL or sth else, even though I know this encryption should be TLS_RSA_WITH_AES_256_GCM_SHA384.
All I know is that the OpenSSL command should be like

openssl enc -d -rsa-with-aes-256-gcm-sha384 -a -in flag.enc -K private.pem -out ans.bin

but this is incorrect.
Could you help me?

 used Fermat's factorization method to recover the two prime factors (script here):

script link is not correct. do you refer to this script? https://wiremask.eu/articles/fermats-prime-numbers-factorization/