JayJay's Playground

[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

[Jay Jay]

I am on the trail boys.....just need the time to sit with it a while....still not giving up

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

[David Franklin]

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

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.

[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

[Jay Jay]

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

Thanks for doing the ground work for me, if I sit back and wait you can give me the answer aswell