prints the following:
"Simon Tatham"
Specifically, it takes a power mapped string sequence and shifts the values off. Each set equates to a line of #'s and spaces. Pretty ingenious, actually.
Specifically, it takes a power mapped string sequence and shifts the values off. Each set equates to a line of #'s and spaces. Pretty ingenious, actually.
The question is how to get the values of "x" and how to get the modulo value. You just need to compute row * * (1/37) mod 0x13AC59F3ECAC3127065A9 . I can't for the life of me recall how to do it, but you can see the result at Wolfram Alpha: http://www.wolframalpha.com/input/?i=x+**+37+mod+14864685590... .
How then do you get the 0x13AC59F3ECAC3127065A9? It needs to be relatively prime to the values, and larger than any of the output values. Beyond that, I don't know why that specific (composite, with two factors) number was chosen. Nor do I know why 37 was chosen.
http://en.wikipedia.org/wiki/RSA_(algorithm)
The answer to "why" is: he's the author of the Putty SSH client, and he decided to use the bignum feature of Python to demonstrate the encryption in as little code as possible and make the signature out of it.