CHAPTER XII
Multiple-Alphabet Ciphers — The Vigenère
The theory of polyalphabetical substitution is as follows: The encipherer has at his disposal several simple substitution alphabets, usually 26. He uses one such alphabet to encipher only one letter; for the next letter, he may use another cipher alphabet; for the third letter, a third alphabet; and so on, until some preconcerted plan has been followed out. The earliest known ciphers of this kind, the Porta (1563) and the Vigenère (1586), made use of a chart, or _tableau_, on which all of the available cipher alphabets were written out in full one below another. The Gronsfeld cipher (1655) used a purely mental encipherment plan; but the Beaufort ciphers, arriving two hundred years later (1857), again made use of a tableau, and something of the same idea survives in the use of _strips_; that is, a set of long narrow cards, each card carrying a simple substitution key. Slides, however, must have been in use near the time of Beaufort, since the best-known of the slide-ciphers, the Saint-Cyr, was being taught in 1880 at the French military school from which it takes its name. As to cipher disks, these appear to have been known even in Porta’s time, and have passed through many complications, though it has not been a great many years since a very simple disk was in use in our own army. (A drawing of the United States Army Cipher Disk may be seen in Webster’s New International Dictionary.)
To know thoroughly any one of these ciphers is to understand the fundamental principles of all, and we are going to base our studies chiefly upon the Vigenère, most perfect of the simpler types, and the basis upon which others have been founded. Fig. 85 shows, in full, the Vigenère tableau, or “alphabet square.” The alphabet standing horizontally across the top of this figure is the plaintext alphabet, and serves for the whole tableau. Below this, and parallel to it, are the 26 “Caesar” alphabets, the first one being a duplicate of the plaintext alphabet, while the remaining 25 have been _shifted_, one letter at a time, until the last one begins with _Z_. These are the 26 available cipher alphabets, and each one is named according to its first letter, which is also spoken of as its _key_. Thus, the key-letter _A_ points out the _A_-alphabet; the key-letter _B_ points out the _B_-alphabet, and so on. The alphabet standing vertically on the left side of the tableau is merely a list of these key-letters, and so is called the key-alphabet. Except where cipher machines are employed, the ordinary plan of encipherment does not make use of the full 26 available cipher alphabets; only a few of these are used, and these few are taken always in a given rotation, so that the cipher becomes _periodic_. If the rotation includes, say, twelve of the cipher alphabets (whether or not these are all different), the cryptograms are said to have a _period of 12_. (The word “cycle” is also used in this connection.) Since each letter of the normal alphabet is the key to one of the Vigenère cipher alphabets, the encipherer, wishing to make use of several different cipher alphabets, is able to remember their sequence by means of a key-word, in which each letter will point out one particular cipher alphabet. If today’s key-word is BED, only three cipher alphabets will be used, the _B_-alphabet, the _E_-alphabet, and the _D_-alphabet, and the cryptograms will all have a _period of 3_. But if, tomorrow, the key-word is changed to CONSTANTINOPLE, the complete rotation will include fourteen alphabets, and the cryptograms will have a _period of 14_.
Figure 85
THE VIGENÈRE TABLEAU
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
A A B C D E F G H I J K L M N O P Q R S T U V W X Y Z B B C D E F G H I J K L M N O P Q R S T U V W X Y Z A C C D E F G H I J K L M N O P Q R S T U V W X Y Z A B D D E F G H I J K L M N O P Q R S T U V W X Y Z A B C E E F G H I J K L M N O P Q R S T U V W X Y Z A B C D F F G H I J K L M N O P Q R S T U V W X Y Z A B C D E G G H I J K L M N O P Q R S T U V W X Y Z A B C D E F H H I J K L M N O P Q R S T U V W X Y Z A B C D E F G I I J K L M N O P Q R S T U V W X Y Z A B C D E F G H J J K L M N O P Q R S T U V W X Y Z A B C D E F G H I K K L M N O P Q R S T U V W X Y Z A B C D E F G H I J L L M N O P Q R S T U V W X Y Z A B C D E F G H I J K M M N O P Q R S T U V W X Y Z A B C D E F G H I J K L N N O P Q R S T U V W X Y Z A B C D E F G H I J K L M O O P Q R S T U V W X Y Z A B C D E F G H I J K L M N P P Q R S T U V W X Y Z A B C D E F G H I J K L M N O Q Q R S T U V W X Y Z A B C D E F G H I J K L M N O P R R S T U V W X Y Z A B C D E F G H I J K L M N O P Q S S T U V W X Y Z A B C D E F G H I J K L M N O P Q R T T U V W X Y Z A B C D E F G H I J K L M N O P Q R S U U V W X Y Z A B C D E F G H I J K L M N O P Q R S T V V W X Y Z A B C D E F G H I J K L M N O P Q R S T U W W X Y Z A B C D E F G H I J K L M N O P Q R S T U V X X Y Z A B C D E F G H I J K L M N O P Q R S T U V W Y Y Z A B C D E F G H I J K L M N O P Q R S T U V W X Z Z A B C D E F G H I J K L M N O P Q R S T U V W X Y
To make use of a cipher alphabet, say the _B_-alphabet, we may lay a ruler across the tableau in such a way that this one alphabet is pointed out. Then, to encipher any letter, as _S_, we may find this letter, _S_, in the plaintext alphabet at the top, and trace down its column as far as the _B_-alphabet which is being pointed out by the ruler; we find that the substitute, in this alphabet, is _T_. Or, wishing to decipher _T_, we find this letter in the _B_-alphabet and trace upward to the plaintext alphabet in order to find that its original is _S_. While the foregoing explains the principle, it has not been expressed in the usual language. Where we have mentioned the use of the _B_-alphabet, it is much commoner to hear that a certain letter has been enciphered or deciphered “with key-letter _B_,” and the usual description of the encipherment will be somewhat as follows: To encipher _S_ by _B_, find _S_ in the plaintext alphabet, find _B_ in the key-alphabet, and use the substitute which is found at the intersection of the _S_-column with the _B_-row. Or: To decipher _T_ by _B_, first find the key-letter _B_, trace horizontally to the right as far as the cipher-letter _T_, then trace upward to its original, _S_. This, we believe, is the original description, as explained by Blaise de Vigenère himself, and the original encipherment plan was that indicated in Fig. 86. The message of this figure is SEND SUPPLIES TO MORLEY’S STATION. The key-word, BED, has been repeated often enough to pair one key-letter with each text-letter, and these pairs are handled _one at a time_: _S_ is enciphered by _B_, _E_ is enciphered by _E_, _N_ is enciphered by _D_, and so on, following the original description.
Figure 86
Original Method of VIGENÈRE Encipherment
Key: B E D B E D B E D B E D B E D B E D B E D B E D B E D B Message: S E N D S U P P L I E S T O M O R L E Y S S T A T I O N Cipher: T I Q E W X Q T O J I V U S P P V O F C V T X D U M R O
Figure 87
Modern Enciphernent
B E D B E D B E D
S E N D S U P P L T I Q E W X Q T O
I E S T O M O R L J I V U S P P V O
E Y S S T A T I O F C V T X D U M R
N O
5 10 15 20 25 30 T I Q E W X Q T O J I V U S P P V O F C V T X D U M R O X X
The modern method would be that of Fig. 87. Knowing that a great many letters are going to be enciphered by _B_, a great many others by _E_, and a great many others by _D_, and having no wish to preserve word-divisions, we begin by writing our plaintext into three columns (or by grouping it conveniently), and then encipher at a single writing all of those letters which are to be enciphered by any one same key-letter. That is, we apply one cipher alphabet at a time, as first explained. The modern practice will also require that the cryptogram be taken off in five-letter groups, and that the final group be made complete. This is another of those cases in which the decryptor will number his letters, as shown in the figure. The student who has not previously met the Vigenère cipher is urged to perform the two operations of encipherment and decipherment and thus familiarize himself with the use of a tableau; it is possible that in most of his subsequent reading he will find explanations based on the “columns” and “rows” of a “tableau,” when, as a matter of fact, no tableau has been used. To understand how this might be, suppose we take a look now at the Saint-Cyr cipher.
Figure 88
THE SAINT-CYR SLIDE
┌─────────────────────────────────────────────────────┐ │ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z │ ┌───────┴┬───────────────────────────────────────────────────┬┴──────────── │ A B C D│E F G H I J K L M N O P Q R S T U V W X Y Z A B C D│E F G H I J..\ └───────┬┴───────────────────────────────────────────────────┴┬─────────────┘ └─────────────────────────────────────────────────────┘ (To Y.)
In Fig. 88, we have the principle of the sliding device by means of which this encipherment is accomplished. The Saint-Cyr slide is very easily prepared of cardboard, or of any other flexible and fairly strong material, but may also be prepared of wood, or may be set up for any temporary purpose on two strips of paper. Its details, also, may be varied to suit the operator’s own convenience. As shown, however, the upper and single alphabet, which is the plaintext one, is written on a card, and slots will be cut in this card at two points: Just below and to the left of _A_; and just below and to the right of _Z_. This plaintext alphabet is considered stationary. The lower and double alphabet, which is to furnish all of the substitutes, is written on a long narrow strip, the two ends of which may be inserted into the slots of the other card. This strip, or slide, may then be moved back and forth at will. However prepared, the spacing must be uniform throughout both alphabets. The Saint-Cyr cipher also makes use of a key-word in which each letter is the key to a cipher alphabet, and which is applied exactly as in Fig. 86 or Fig. 87. To apply the key-letter _B_, we adjust the slide in such a way that the _B_ of the sliding alphabet will stand directly beneath _A_ of the stationary one. This gives us exactly the same set-up which we used in Chapter IX for cases of simple substitution; that is, we have a plaintext alphabet with a cipher alphabet standing just below it; each plaintext letter is standing directly above its substitute, and each substitute directly beneath its original. The cipher alphabet just referred to, in which key-letter _B_, found in the sliding alphabet, is standing directly below the index-letter, _A_, found in the stationary alphabet, is identical with the _B_-alphabet of the Vigenère tableau, and is even called by the same name. Should we move the sliding alphabet, so as to place key-letter _C_ directly beneath index-letter _A_, we reproduce the _C_-alphabet of the Vigenère cipher, again called by the same name. In the figure, we have the _E_-alphabet in position, with key-letter _E_ standing directly beneath index-letter _A_. And since the sliding alphabet may be placed in 26 different positions, each time reproducing one of the Vigenère cipher alphabets, having the same key and the same name, it appears that our Saint-Cyr “cipher” is merely a duplication of the Vigenère. The chances are, then, that even though we call our cipher by its original name, and even make references to its tableau, our actual work of encipherment and decipherment will have been accomplished by means of the more convenient and rapid Saint-Cyr slide. But where a slide is possible, a _cipher disk_ is also possible, and many will prefer to use the disk.
To prepare one of these, we might proceed as follows: First, cut out from cardboard (or other desired material) a pair of disks, one smaller than the other. Divide the peripheries of both disks into 26 equal segments, and write the 26 letters of the alphabet in a circle around both of the peripheries, causing both alphabets to run in the same direction. Place the smaller disk on top of the larger; and, finally, stick a drawing pin through the exact center of both disks, to serve as a pivot. The smaller disk may now be rotated to 26 different positions, so that any desired key-letter can be caused to stand beside index-letter _A_ of the outer disk, and will place in position the cipher alphabet of which it is the key. The use of this revolving alphabet in place of a sliding one does away with the necessity for doubling its length.
Now let us examine carefully Fig. 89, with its two examples of decipherment. At (a) of this figure, a short cryptogram fragment, beginning _T I Q_. . . . , is being deciphered with the original key-word, BED, and is bringing out the message, SEND SUPPLIES. . . . . This, of course, is to be expected of any cipher. But at (b), it is this _message fragment_, SEND SUPPLIES, which is acting as a _trial key_; exactly the same process is being used as if applying the true key, and this decipherment is bringing out the original key, repeating over and over. The Vigenère cipher, then, works equally well in reverse, and in this respect it differs from some of its kindred ciphers. To understand this peculiarity, we have merely to consider the tableau. Concerning this we have said that the horizontal alphabet which stands across the top is the plaintext alphabet, and that the vertical one at the left is merely a list of keys. Suppose we decide to look at it the other way round, and say that the vertical alphabet at the left is the plaintext one, and that all 26 of the cipher alphabets are standing on end with their key-letters at the top, so that the horizontal alphabet, written across the top, is merely a list of these keys. Will there be any difference in the encipherment? Might the slide, also, be prepared in a vertical position? Does it make any difference in the results whether we encipher plaintext _SEN_ by key BED, or encipher plaintext BED by key _SEN_?
One road to decryptment, then, is clearly indicated. If we have a probable word, we may use this word exactly as if it were the key, and, if it is actually present, it will bring out the true key. Or, if we have no probable word, we may try probable sequences, or make use of the trigram list. Here, however, we have two separate cases: The simplest, in which the probable word is long enough to bring out the key-word _repeating_; and the most difficult, in which the sequence, or probable word, is very short, and will bring out only a short fragment of the key-word.
Figure 89
(a) Deciphering with the KEY:
Key: B E D B E D B E D B E D....... CRYPTOGRAM: T I Q E W X Q T O J I V....... Plaintext: S E N D S U P P L I E S.......
(b) Deciphering with the MESSAGE:
Trial Key: S E N D S U P P L I E S....... CRYPTOGRAM: T I Q E W X Q T O J I V....... True Key: B E D B E D B E D B E D.......
The simpler case is readily explained. We have, say, a cryptogram beginning _U S Z H L W D B P B G G F S_. . . , in which we suspect the presence of the word SUPPLIES. We decipher the first eight letters, _using this probable word as a trial_ _key_, and obtain a jumbled series of letters _C Y K S A O Z J_, which is not satisfactory. We leave off the first cryptogram-letter, _U_, and decipher the next eight, obtaining another jumbled series of letters _A F S W L V X X_. We start again at the third letter, then at the fourth letter, and still there is no information. But at the fifth trial, beginning at the fifth cryptogram-letter, we obtain a series _T C O M E T C O_, and this is satisfactory, not necessarily because we have recognized the word COMET, though this, of course, is a very desirable happening, but because the last three letters, _T C O_, are repeating the first three. _The series is beginning over_. The student should practice doing this, using both the tableau and the slide (or disk), until he is sure that he understands the process. The exact details of his work are immaterial; if he is sure that his key will be a recognizable word, it will be satisfactory to make decipherments directly on the cryptogram, erasing as he goes. Sometimes, however, the key is incoherent, or apparently so, and a jumbled series like _C Y K S A O Z J_ might actually be the correct key; for this reason, it is well to follow a routine of some kind which will preserve all of the decipherments. One such plan is illustrated in Fig. 90.
Here, the cryptogram, or a substantial portion of it, would be written across a sheet of quadrille paper, and the probable word would be written at one side, where each of its letters will govern one row of decipherments. The first letter, _S_ in the figure, has been used to _decipher the whole row of cryptogram-letters_, giving every possible key-letter which can produce _S_. The second letter, _U_, has been used to decipher them all again (except the very first letter; we do not expect a word UPPLIES). The third letter, _P_, has been used to decipher them all a third time; and soon. The resulting rows of decipherment include all key-letters which could have produced _S_, then _U_, then _P_, and so on. To read them consecutively, beginning at any cryptogram letter, start immediately below that letter, and read diagonally downward to the right. The first diagonal gives key _CYK_. . . , the second gives _AFS_. . . , and so on to the fifth diagonal, showing the key as _T C O M E T C O_. (If it is desired that these possible keys should come out standing in a horizontal position, then the _decipherments_ may be made diagonally.) F. R. Carter, the originator of this scheme, does not necessarily make all of the decipherments which are included in the figure. He begins with the assumption that his key will be a recognizable word; having deciphered in full the first three rows, he abandons all of those diagonals which cannot develop into words. If, in the end, he is forced to conclude that his key was incoherent, _no decipherments have been erased_; he may still go back and develop the rest of his diagonals, in the hope that one will begin repeating.
Figure 90
Deciphering with the Probable Word SUPPLIES - Routine of F.R.CARTER
Cryptogram fragment: .... U S Z H L W D B P B G G F S .........
Probable word: S C A H P T/ E L J X J O O N A ......... U Y F N R C/ J H V H M M L Y ......... P K S W H O/ M A M R R Q D ......... P S W H O M/ A M R R Q D ......... L A L S Q E/ Q V V U H ......... I O V T H T//Y Y X K ......... E Z X L X C//C B O ......... S O// (Key: COMET)
The more difficult of our two cases, that in which we have no probable words other than _the_, _and_, _which_, _that_, _have_, _but_, etc., can follow exactly the routine outlined in Fig. 90; but in this case there must be two separate work-sheets. Here, it is usually better to forget words and start at once with the list of normally frequent trigrams, _THE_, _AND_, _THA_, _ENT_, _ION_, _TIO_, etc. The key-fragments which are deciphered by these will be very short, and very numerous; a great many of them will be very good usable sequences, and perhaps the correct key-sequence will not look quite so inviting as others which are incorrect. It becomes necessary, then, to have a second work-sheet on which we may take these fragments one by one and try them as keys. If any one of them is a fragment of the original key, _it must bring out fragments of plaintext, and must bring them out at some regular interval_. If the scheme of Fig. 90 is the one preferred, the second work-sheet may be prepared exactly like the first, and used in the same way. The only difference is as follows: On the first work-sheet, where the figure shows the word SUPPLIES, a supposed trigram (_THE_, _AND_, etc.) will have been used to bring out supposed key-fragments; on the second work-sheet, one of these supposed key-fragments will have been used. These new rows of decipherment may then be examined to find out whether any of the new diagonals contain apparent plaintext fragments, and, if so, whether these occur at a regular interval.
For this kind of work, however, Ohaver has offered us another routine which requires somewhat more preparation than Carter’s but which is well worth the extra trouble, especially if it be remembered that a trigram-search is never necessary except with the shortest of cryptograms. For the longer cryptograms, we have easier methods. Ohaver’s plan can be examined in Fig. 91.
The cryptogram, shown at the top of this figure, contains 26 letters; therefore, remembering that each letter, except the final two, may begin a cipher-trigram, it contains 24 trigrams. The preparation of the two work-sheets requires that these 24 cipher-trigrams be written out in full on both sheets. This work should be done in ink, or on the typewriter. Then, too, for a reason which will be explained in a moment, it is well that the first of these work-sheets be prepared with a great deal of space, say seven or eight lines, between its rows of trigrams. Now, considering the first work-sheet, shown at (a) of the figure: The upper row shows the 24 cipher-trigrams as originally written out. We have been working down the trigram list, using every normally frequent trigram as a trial key, and have failed to find _THE_, _AND_, _THA_, or _ENT_, which means that we have done quite a lot of tedious work. We have now reached the normally frequent trigram _ION_, and this we have applied as a trial key, assuming one by one that each of the 24 trigrams represents _ION_. We have, then, 24 decipherments on the second row, and _any one_ of these 24 deciphered trigrams might be a fragment of the original key. However, it is natural to assume that a trigram _FRI_ or _WAY_ is more likely than one such as _XHR_ or _NQB_, and those fragments which look like usable sequences have been underscored in the figure. These are to be tested first. At (b), we have the other work-sheet, the upper row, as before, showing the 24 possible cipher-trigrams. Here, we have already failed in our tests for key-fragments _FRI_, _WAY_, _DZI_, _NYE_, which means that we have done some more tedious work, and we have now arrived at the possible key-fragment _EDA_. If this sequence, _EDA_, is actually a portion of the original key, it must not only bring out fragments of a plaintext message, but must bring them out at some constant distance apart. The point at which we found this is the tenth trigram, and here it may be advisable to remind that this begins at the tenth cryptogram letter; that is, _every trigram presents only one new letter_, so that to find a completely different trigram in either direction, we must count backward or forward a distance of three trigrams.
Figure 91
L N F V E O L N V M R N G Q F H H R N H I R V F E B,
(a) Trial Sheet No. 1 ION LNF NFV FVE VEO EOL OLN LNV NVM VMR MRN RNG NGQ AZS FRI XHR NQB WAY GXA DZI FHZ NYE EDA JZT FSD
GQF QFH FHH HHR HRN RNH NHI HIR IRV RVF VFE FEB YCS IRU XTU ZTE ZDA JZU FTV ZUE ADI JHS NRR XQO
(b) Trial Sheet No. 2 EDA LNF NFV FVE VEO EOL OLN LNV NVM VMR MRN RNG NGQ HKF JCV BSE RBO ALL KIN HKV JSM RJR ION NKG JDQ
GQF QFH FHH HHR HRN RNH NHI HIR IRV RVF VFE FEB CNF MCH BEH DER DON NKH JEI DFR EOV NSF RCE BBB
(c) Testing out the Period 5
D A E D A E D A E D A E D A E D L N F V E O L N V M R N G Q F H H R N H I R V F E B I N . . A L L . . I O N . . B E H . . D F R . . A Y
(TION?) (FRIDAY?)
Beginning, then, at the tenth trigram, and examining every third trigram in both directions, we find that our key-fragment has given us the following decipherments: _HKF_, _RBO_, _HKV_, _ION_, _CNF_, _DER_, _JEI_, _NSF_. These are largely incoherent; but, in addition, it must not be overlooked that on the continuously-written cryptogram, these would be consecutive, giving us a message _H K F R B O_. . . Applied at interval 3, then, our key-fragment _EDA_, will not decipher us a message; therefore, the period of this cryptogram, using this key, cannot be 3.
To examine for the possibility of a period 4, we start again with our tenth trigram, and examine every fourth decipherment in both directions; our series, this time, is _JCV_, _KIN_, _ION_, _MCH_, _NKH_, _NSF_. Most of these are usable, and the first one might be due to nulls, initials, and so on; but here again we have the reminder that with each trigram representing only one new letter, these are _almost consecutive_, starting at the second cryptogram letter, so that our message, with each fourth letter missing, will be as follows: _* J C V * K I N * I O N_. . . . Unless we can think of some letters which would fill these gaps and provide plaintext, our period is not 4.
Trying again, however, beginning at the tenth trigram and examining each fifth decipherment, we find something more satisfactory: _ALL_, _ION_, _BEH_, _DFR_. If these are correct, the period is 5. At (c), we have gone back to the continuously-written cryptogram in order to try these in their places; and since a period 5 would mean that each of the letters _E D A_ is used regularly to encipher each fifth letter, we are able to include two shorter decipherments at the two ends of the cryptogram. The next step in logical order is to try deciphering _T_ in front of _ION_, since the trigram _TIO_ would have been the next one on our trigram list. This brings out key-letter _C_, which, if correct, will decipher correctly at each interval 5, and which extends our key-letters to _C E D A_. We can see, too, that this is not the beginning of the word; the sequence we have is _D A * C E_. In the given example, it is not difficult, also, to guess a probable word, FRIDAY. Now, having twice called attention to the fact that the trigram-search can grow quite tedious, we hasten to point out that it need not be made more so by deciphering each trigram individually. If your trial key is _THE_, set your slide at the _T_-alphabet (or point this out on the tableau), and decipher every first letter on the sheet. Then set the _H_-alphabet in position, and decipher every second letter on the sheet. Finally, set the _E_-alphabet in position and decipher all of the remaining letters.
The foregoing few paragraphs have illustrated the worst case in almost its worst form, but will show the principle. Now let us consider this work in a much more usual case. As mentioned earlier, the first of the two work-sheets will be prepared with a great deal of space between the rows of trigrams. The full number of decipherments will be made for the first trigram _THE_, but _not erased_. Just below these, a second row of decipherments will be made for _AND_, and these, too, will be left standing. (_THA_ can be omitted.) A third row of decipherments is made for _ENT_, a fourth row for _ION_, and so on down the list, until there are six or eight rows of possible key-fragments. These are all examined and compared with one another, in the hope of finding duplications. Perhaps _THE_ and _AND_ have _both_ brought out a key-fragment _EDA_, or one has brought out _CED_ and the other _EDA_, having _ED_ in common. It is far from unusual, in some of these cases, to find a whole series of these overlapping key-fragments, for instance, _CON_, _ONS_, _NST_. This will explain why many persons consider the trigram-search the simplest and most direct way of attacking a Vigenère cryptogram.
For the benefit of the novice, we end the chapter at this point in order that he may have some practice. Example 104 comprises a thrilling serial with all the trimmings, gripping and original title, smashing climax, and a brave hero, John Miller. The key to the title is STRANGE. Part I repeats a word found in the title; part II repeats a word of part I; and somewhere are the trigrams _NOT_, _CON_, _YET_, _ING_, _TEN_, _THE_. We have heard, too, that an amateur encipherer will occasionally encipher the nulls which he adds in his final group. Example 105 is easily investigated through short common words. As to the remaining examples, while it is true that they can be attacked by the trigram method, the student will probably prefer to leave them until he has seen the methods outlined in Chapters XIV and XV.
104. By PICCOLA. (For trigram practice. A new key for each fragment).
Title of Serial: S L K R N T K W W Z S N V T W T I A A I I X X X X. Part I: R I G Z V Z K I U O M H J L B W F P K S R Z T R H E J T W I O S W I O S G Q I I. Part II: H H T X T N E O L V R M T U L C L P P X T Y R X K U K B U W U O J Z H X M Z K H. Part III: S Y Z Y R T N F U R K C U S I I R Q U X W U F K C J N R L Q N F O K V X M P U O N H J A X J H V O P. Part IV: X B V P Y S X C J J Y U R X O T S P I N Y I L U P A V M X M M F C I B S T I T O O T B R O.
105. By PICCOLA. (For investigation of short words. - Still Vigenère!)
V Y I D J G I E J S N V R J H J F J D B G E K O W U Y A R F F Z W V O K U X R P G R J U O E K M R B U Y S U H Q W J L J G C I W H G I W.
106. By NEON. (Any repeated trigram is worth watching!)
P Q X E J F V E G Y M N Y N Y I U F R D S G V R I L P S G Z T M E S I R K N Y I G P E R W G R R N D L O J N T Y I D X O T Y C I P C R E V C E S G O I R L I S I R Z Q E U C G L T C I X H Y I X H E L E K Y J E K P X I E Y R R S L H D L I F Y G P R J G S D I C E.
107. By THE ADMIRAL. (Numbers are always possible!)
L V P R V S F P T Y J S P H L F R C E U S B O S Z P H J F Z N S O A P K T T V V Z C F R J X C C T P W W R H K E W Y U K W G L N U X C C T P X W G E R F R Z N V Z O W F J W Q Z N U K W Y O E W M P A I.
108. By NEON. (This cryptogram, circulated in April, 1935, caused great consternation among solvers. Do you see any reason why?)
T W G J C N I U J X C S L S K K B N V G W I P S U Q I U J A U L J U Z H B E V J V M A O H G G L T P D G L E Y S S L A F I M J S W Q I U M O N N F L V H I U I Z D Q K V Y R T W H I M R F E U K P N O V Y T K E F N V Q N O T.
109. By PICCOLA.
A X S E H G O I W W F O I A L G E M Q W E E N B W R E I K L S H Z Z Q X L G A H V P Z K L D L G G D W T C M H Q D J N W K E H M V V A B M A.