Go Exercise Your Brain …

Have you read all the Sunday papers, and now bored? Well, why not exercise your brain with a little cipher puzzle?
Photo by Valentin Salja on Unsplash

Go Exercise Your Brain …

Have you read all the Sunday papers, and now bored? Well, why not exercise your brain with a little cipher puzzle?

I am using 60-bit prime numbers of p and q, and the Okamoto–Uchiyama public key method. For this we calculate a value of n and which is p² q (and where p and q are prime numbers of a given length). If you can factorize the n value to find p and q, you should be able to decipher my message. Can you decipher the cipher message I have used here:

==Public key====
n= 859605396696422869715248034194787678707434399547429513
g= 758648925756522399683421262792901202059189278914907486
h= 731334377529547874735643734217524346152775053184176743

==Cipher===
c= 576219646186833327486557681039414360929112022589734152

The theory (and Python code for the decryption process) is here:

Okamoto-Uchiyama
Message= hello ==Public key=== n= 357144329288820404004007663971674051954729307045939508876563494539894121 g=…asecuritysite.com