[Help] Decrypting an OT RSA Key.

[Evil Mark]

Hello, today I am here to ask you on how to decrypt a file that uses OT RSA key.

The keys are in the following order:

Decrypt Code

"14299623962416399520070177382898895550795403345466153217470516082934737582776038882967213386204600674145392845853859217990626450972452084065728686565928113",

Decrypt Code

7630979195970404721891201847792002125535401292779123937207447574596692788513647179235335529307251350570728407373705564708871762033017096809910315212884101

Encrypt Code

46730330223584118622160180015036832148732986808519344675210555262940258739805766860224610646919605860206328024326703361630109888417839241959507572247284807035235569619173792292786907845791904955103601652822519121908367187885509270025388641700821735345222087940578381210879116823013776808975766851829020659073

So anyway, I was wondering if anyone of you experienced members could help me decrypting this piece of RSA code.

I've been talking to alot of experienced programmers who just weren't able to do it, if you're up for the challenge then please by all means post in the thread.

All I need to know is how to decrypt it using the above stated keys.. :ninja:

 

[stian]

Hu, you don't give us any message or codes. Post them as this: encrypted message, d, p, q, n etc.

 

[DarkstaR]

Stian, its the RSA key OT uses, meaning same exponents, and public/private keys.

 

[stian]

d:

46730330223584118622160180015036832148732986808519344675210555262940258739805766860224610646919605860206328024326703361630109888417839241959507572247284807035235569619173792292786907845791904955103601652822519121908367187885509270025388641700821735345222087940578381210879116823013776808975766851829020659073

n:

109120132967399429278860960508995541528237502902798129123468757937266291492576446330739696001110603907230888610072655818825358503429057592827629436413108566029093628212635953836686562675849720620786279431090218017681061521755056710823876476444260558147179707119674283982419152118103759076030616683978566631413

e:

65537

c = encrypted number
m = message

The formula is:
m = c^d mod n

 

[DarkstaR]

Yeah but hes not gonna figure that out, lmao.

I'm pretty sure this is the same guy who I was talking to on MSN.

He had a decrypted TFS and asked me to find the RSA from it, so I searched the HUGGE .c file with regexp to find the key, only to realize its normal otkey (how the fuck did I know?)

Anyways, I told him to check here for solutions because I didn't have time to write an RSA algorithm into a program, just for this purpose.

Bottom line is I think this is more of "do it" than "explain it"