Tags: rsa-crypto

Rating:

Challenge: RSA 1
----------------------------------------
Category: Cryptography
----------------------------------------
50 points
----------------------------------------


Description:

Written by neptunia
I found somebody's notes on their private RSA! Help me crack this.

Hint: Go google RSA if you're stuck.

File = ciphertest1.txt

p: 33499881069427614105926941260008415630190853527846401734073924527104092366847259
q: 34311544767652906613104559081988349779622789386528780506962212898921316785995851
e: 65537
c: 43465248299278658712013216049003172427898782261990372316282214376041873514481386908793943532363461126240609464283533882761307749486816342864113338277082746552


python
#!/usr/bin/env python
import libnum

p = 33499881069427614105926941260008415630190853527846401734073924527104092366847259
q = 34311544767652906613104559081988349779622789386528780506962212898921316785995851
e = 65537
c = 43465248299278658712013216049003172427898782261990372316282214376041873514481386908793943532363461126240609464283533882761307749486816342864113338277082746552

n=p*q
phi=(p-1)*(q-1)
d = libnum.modular.invmod(e, phi)
print libnum.n2s(pow(c, d, n))

#easyctf{wh3n_y0u_h4ve_p&q_RSA_iz_ez_7829d89f}


Original writeup (https://github.com/Ne0Lux-C1Ph3r/WRITE-UP/blob/master/EasyCTF/Cryptography/RSA_1.md).