RSA 1024 bit decoding

[Jay_]

Could anyone decode this RSA 1024 bit encoded?

I4mF9aqTee0NYZVpebIeTg6q6VsRc+ruDS0DqtrF2Uyqu8mhmpnxmBNXqO47lPdv
4G+ZyvU6kgxqF48keHLBpV/LFUP5S8cp3iOfTgqLEB6UHxjgsBjBfFpz0iSvgL7y
ZlIxX6ImXoYgX3TWPjuAXR/rYBkqGJj89Rg6XfmGGRE=

Please also explain the process if you can. I can't find a good site to explain the procedure.

Regards,
Jay

 

[ahmed osama]

Could anyone decode this RSA 1024 bit encoded?

I4mF9aqTee0NYZVpebIeTg6q6VsRc+ruDS0DqtrF2Uyqu8mhmpnxmBNXqO47lPdv
4G+ZyvU6kgxqF48keHLBpV/LFUP5S8cp3iOfTgqLEB6UHxjgsBjBfFpz0iSvgL7y
ZlIxX6ImXoYgX3TWPjuAXR/rYBkqGJj89Rg6XfmGGRE=

Please also explain the process if you can. I can't find a good site to explain the procedure.

Regards,
Jay

read this please (check the pdf link inside the site)

768-bit RSA cracked, 1024-bit safe (for now)

 

[Jay_]

Are you saying it can't be solved or that people have not solved this?

Could anyone take a similar example starting with the whole encoded sequence (similar to what I have got in the question) and explain HOW to solve a similar code? Explain with less bits if the number of bits is the problem in my original question.

Thanks

 

[phongphanp]

Are you had try hand calculation on this RSA code ? I think it easy than programming from exe to c code on the people in Reverse Engineer's work.

 

[Jay_]

Phongphanp, I know nothing about RSA encoding or decoding. It was more like a challlenge question someone gave me. I just wanted to see how hard it was, which is why I asked it here. So I am looking for any sort of calculation on this - hand, calculator, computer. I mean, is this question one of the "never-been-solved-on-Earth-before" type questions or just a tough question solved by many experts? If it can be solved, how so?

Thanks for all your responses guys.

 

[phongphanp]

RSA problem is believed to be computationally equivalent to
integer factorization problem.

Example of RSA with small numbers:


p = 47, q = 71, compute n = pq = 3337


Compute phi = 46 * 70 = 3220


Let e be 79, compute d = 79-1 mod 3220 = 1019


Public key is n and e, private key d, discard p and q.


Encrypt message m = 688, 68879 mod 3337 = 1570 = c.


Decrypt message c = 1570, 15701019 mod 3337 = 688 = m.


and...

You may try to study Number Theory not computability but for some calculation.

---------- Post added at 11:09 ---------- Previous post was at 11:03 ----------

Number Field Sieve -- from Wolfram MathWorld

 

[phongphanp]

Jay: You may try to implement the hardware for RSA 1024 bit in FPGA or DSP form to test but the corporated software may be different so you should contact manufacturer of your board.