One thing that's funny is the frequency distribution of the message:
Code: Select all
01234567890123456789012345
abcdefghijklmnopqrstuvwxyz
** * * *** **** * **
* * ** *** * *
*
It's very "bursty": lots of doubletons and empty slots, I'd expect a random distribution to be flatter.
In particular, the message only occupies 14 of the possible 26 slots. This led me to wonder "is there a 4-character one-time pad which would encrypt an {A,C,G,T} sequence this way". The answer is no, oh well. The (rather dull) reason why follows...
Let S be the set of numbers in the message "ijoopyaattzbqkipyerggjq" (treating the letters as numbers 0...25):
Code: Select all
S = {0,1,4,6,8,9,10,14,15,16,17,19,24,25}
The only possible values for x s.t. all of x+a,x+c,x+g,x+t are in S are:
Code: Select all
i: +a=8=i, +c=10=k, +g=14=o, +t=1=b
y: +a=24=y, +c=0=a, +g=4=e, +t=17=r
This leaves:
But there's only one x s.t. three of x+a,x+c,x+g,x+t are in S', which is:
There would have to be two such x for the one-time pad.
This means there's no 4-character one-time pad which encrypts an {A,C,G,T} sequence to "ijoopyaattzbqkipyerggjq".
I dare say you were on the edge of your seats about that one.
Rearrange the words "at", "straws" and "clutching" to form an appropriate famous word or saying.