|Perl: the Markov chain saw|
Rot13 Challengeby PyrexKidd (Monk)
|on Feb 10, 2011 at 01:01 UTC||Need Help??|
PyrexKidd has asked for the
wisdom of the Perl Monks concerning the following question:
I was browsing here and found this Rot13 Challenge.
Rot13 Encryption is performed by shifting the letters 13 characters to the right. A becomes N, B becomes O. The cool thing about this is an encrypted string can be decrypted by using the same algorithm. IOW, the A becomes N, N becomes A.
my first thought was to convert the characters to their equivalent ascii number, shift it, then return the ascii character.
Then I figured why not use the translate function...
So the challenge is this: