Page 2 of 2

Re: JayJay's Playground

Posted: Thu Aug 07, 2008 8:59 pm
by gstyle
I am now assuming this is RSA encryption algorithm. Using pq=851 as the public key and e=5 as the public key exponent?

I hate maths.

You dont want to tell me the two prime numbers you used to get pq do you :confused:

Re: JayJay's Playground

Posted: Thu Aug 07, 2008 11:36 pm
by Jay Jay
I am on the trail boys.....just need the time to sit with it a while....still not giving up :D

........have to say when I saw you made me a 'playground' didn't think it would be this hard!

Re: JayJay's Playground

Posted: Fri Aug 08, 2008 6:42 am
by David Franklin
gstyle wrote:I am now assuming this is RSA encryption algorithm. Using pq=851 as the public key and e=5 as the public key exponent?
Correct.
You dont want to tell me the two prime numbers you used to get pq do you :confused:
If you really want, but they are quite easy to find by guesswork.

But assuming you're going to use a computer, pq is so small here that it's easy to brute-force the decryption exponent without needing to go through the steps relying on factorizing 851.

Re: JayJay's Playground

Posted: Fri Aug 08, 2008 12:20 pm
by gstyle
Ah ha so I am thinking 23 and 37 are the prime numbers. The totient is 792...so now I have to work out e * d = 1 (mod (792)) .

Did I mention I really hate maths :angry:

Re: JayJay's Playground

Posted: Fri Aug 08, 2008 12:26 pm
by Jay Jay
gstyle wrote:Ah ha so I am thinking 23 and 37 are the prime numbers. The totient is 792...so now I have to work out e * d = 1 (mod (792)) .

Did I mention I really hate maths :angry:
Thanks for doing the ground work for me, if I sit back and wait you can give me the answer aswell :wink: