This message contains 160 letters and it will be noted that the only letters used are A, G, N, R and T.

We may expect a simple two-letter substitution cipher at once. It will simplify the work if we divide the cipher into groups of two letters and then, if we find there are 26 or less recurring groups, to assign an arbitrary letter to each group and work out the cipher by the method of Case 6.

RN TG NR AA GR NA RN AG TG RA TG AA NN AN GG RA RA TN AA NR NN NR NA AA GG AA NG RN GG NN NR NA AA AN RA TN AN NN GG RN RN NR GT TG RG TG GR NA RN TG NN AR TG GR NR GR NN TG TG AA NN AR NA RN RT TG AG GG AA AA NA NN AR NA GA NG NA TN NN AT

With arbitrary letters substituted, we have

A B C D E F A G B H B D I J K H H L D C I C F D K D M A K I C F D J H L J I K A A C N B O B E F A B I P B E C E B B D I P F A Q B G K D D F I P F R M F L I S

Now, preparing a frequency table, with note of prefixes and suffixes we have:

FrequencyPrefixSuffix
A71111111FMKAFFBGKACBQ
B101111111111AGHNOAPIBQCHDOEIEBDG
C6111111BDIIAEDIFFNE
D9111111111CBLFKFBKDEICKMJIDF
E41111DBBCFFCI
F811111111ECCEPDPMADDAAIRL
G211ABBK
H41111BKJHBHLL
I9111111111DCKJBEDFLJCCKPBPP
J3111IDLKHI
K511111JDAIGHDIAD
L3111HHFDJI
M211DRAF
N11CB
O11BB
P3111IIIBFF
Q11AB
R11FM
S11I

A brief study of this table and the distribution in the cipher leads to the conclusion that B, F and C are certainly vowels and are, if the normal frequency holds, equal to E, O, and A or I. Similarly D and I are consonants and we may take them as N and T. I is taken as T because of the combination IP (=possibly TH) occurring three times. The next letter in order of frequency is A; it is certainly a consonant and may be taken as R on the basis of its frequency. Let us now try these assumptions on the first two lines of the message. We have

REAN_OR_E_ENT_____NATAON_N_
III