Spoiler: I'm not. Since there have been a few cryptography threads, I thought I'd try out an interesting side effect of my experimental PRNG on here. (Important - the PRNG is not relevant in any way.)
Here's your reference dictionary.
Here's your message.
Each integer separated by a comma is a character. Each set of integers separated by a | is a word.
Hint: The last letter of each word is the actual letter.
Hint 2: Ask yourself these questions.
If you can't discern a pattern with negatives/positives - is there one? How do you know there is/isn't?
What sort of algorithm would result in the last letter of each word being kept the same as the original when all other letters have been transformed somehow?
Good luck.
Here's your reference dictionary.
0=h, 1=o, 2=l, 3=y, 4=s, 5=i, 6=t, 7=u, 8=a, 9=r, 10=e, 11=b, 12=n, 13=w, 14=k, 15=d, 16=c, 17=p, 18=m, 19=g, 20=v
Here's your message.
Code:
0,0,1,3 | -13,-4,1,6 | 8,6,7 | 0,1,10 | -39,-31,-23,-16,-12,-11,-10,-6,6 | 5 | -19,-10,-6,6 | -5,1 | 26,18,12,14 | -5,1 | 8,6,7 | 11,12 | -299,-165,-75,-25,-2,6,15 | 1,18 | -8,10 | -16,-7,-6,0 | 16,10,10 | -48,-19,-5,10 | -22,-2,6,15 | 47,5,-9,-10,-7,8 | -1,3,15 | 5 | -2,3,0,2 | -54,-25,-10,10 | 8,6,7 | -48,-16,0,5,5,2,4
Each integer separated by a comma is a character. Each set of integers separated by a | is a word.
Hint: The last letter of each word is the actual letter.
Hint 2: Ask yourself these questions.
If you can't discern a pattern with negatives/positives - is there one? How do you know there is/isn't?
What sort of algorithm would result in the last letter of each word being kept the same as the original when all other letters have been transformed somehow?
Good luck.
Last edited:
