CRACKING THE COURTYARD CRYPTO
Document Type:
Collection:
Document Number (FOIA) /ESDN (CREST):
06712772
Release Decision:
RIFPUB
Original Classification:
U
Document Page Count:
31
Document Creation Date:
December 28, 2022
Document Release Date:
August 1, 2018
Sequence Number:
Case Number:
F-2018-00107
File:
Attachment | Size |
---|---|
cracking the courtyard cr[15476471].pdf | 1.06 MB |
Body:
.1?
Doc ID: 6595020
Approved for Release: 2018/07/23 C06712772
Crackint the Courtyard Crvpto
By David D. Stein
Hooked down at the large number of yellow pages littering the top of my desk
obscuring its dark oak finisA Each page was covered in hundreds of alphabetic letters
that, although they appeared to be arranged randomly, were ma*, carefully laid out in
ordered columns. For the past week or so I had been feeling that I was very dose to a
� solution-But was I? Asa hobby, I had solved many puzzles since I was a child and I
had discovered that the most difficult challenge was continually dealing with the. nagging
fear that I may be on the vffong track The voice in my head would whisper, "Maybe
you're mistaken-maybe this first part of the Kryptos code is really not a po6421phabetic
Vigenere Tableau after all-maybe it's 4! different ow of code entirely. Or maybe it is a
Vigenere code, but it's been double or triple encoded-or maybe it was encoded
backward% or maybe...".
This is the worst train of thought an amateur cryptanalyst can have-it goes
nowhere, and it is tempting to give in to frustration at the seemingly infinite number of
possible solutions and abandon the effort. So as I had done dozens of times" before, I
. pushed these thoughts away and pressed on. The thing to do, I told myself again and
again, was simply to she* to what I knew to be the facts Let the encoded text itsdf guide
� me, and keep speculation to an absolute minimum. I should follow my instincts
occasionally, but then remember to ahvays keep track of my assumptions and be
prepared to revise my thinking if a hunch doesn't work out.
1
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
And suddenly it happened�I was hit by that sweetly ecstatic, rare experience that
has been described as a "moment of clarity". All of the doubts and speculations abotrt
the thousands of possible alternate paths simp& melted away, and! clearly saw the one
correct course laid out in front of me. Taking afresh sheet of yellow paper! slowly and
deliberately wrote out a new column of letters, followed by another, and then another. I
� continued this for several pages, then computed mathematical& which rows were mast
likely to represent the correct plaintea letters, and searched for logical combinations
Mown adjacent letters. I tried to contain my excitement as I witnessed the miracle of
the letters slow&forming together into words, one after the other. Within the next few -
hours I had finished After more than seven years and some 400 hours of laboring over
piles a n d piles of paper covered with gibberish I was at last looking down at a
paragraph of clear English text. I had broken out the first part of the Kryptos code.
Introduction
I don't remember the first time I saw, or even heard about, the ICryptos sculpture in
the courtyard. But when I did finally notice the huge, curved copper plates with their
mysterious perforated inscription, I decided I would give their decryption a try. I have
always been interested in puzzles, and I became fascinated with the thought of that
encoded message standing quietly in the headquarters' courtyard year after year, taunting
everyone to try to read its hidden message. After working on the code for a while, I
learned that the basic problem-solving techniques that ineeded for decryption were not so
very different from those that I used in my work as a technical analyst. And in my reading
I also learned something else; that although codebreaking is a fascinating hobby, it's more
2
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
. than just fin and games--throughout history, lives literally have been lost and saved due to
cryptanalysis.
Ever since I initially began sharing with people the progress I had made
deciphering the code covering the Kryptim sculpture, I have had the interesting experience
of being inundated with questions about it. By far the most frequent question asked is
"How much did you get paid for solving that thing?" (Many people seemed to think that
there was some kind of prize involved). The next most common question is "How long
did it take you to solve it?" Notwithstanding my wife's riposte ("so long, that it almost
wasn't worth it"), this question is more difficult. I was not keeping track Of the time, and
in any event, I was not in any hurry to solve the puzzle. Codebreaking for me is a hobby�
if it stops being fin and begins to seem more like work, then it's time to quit and start
doing something else. My best estimate of roughly 400 hours seems about right, had I
been working continuously. I don't know how long it would have taken moif I had been
trying to solve it as fast as possible, though. I had expected the most prealent question to
be "What does the message say?"; however, this one only made it into third place,
followed closely by (humorously I hope) "Don't you have anything better to do with your
time?". Although Fm not sure just how to respond to this last one, I do like to talk about
the progress rve made on the ICryptos problem. However, imust confess that I
sometimes feel a little uncomfortable revealing the message without having an opportunity
to provide a fill explanation. -
There are several reasons that I don't like. to just blurt out the solution to the
Kryptos puzzle. First, it is important to remember that the message is still incomplete�I
have not yet broken out the last 97 characters of the 866 character inscription. Second, as
3
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: '6595020
will be seen, the message is enigmatic and open to interpretation.. Finally, I believe that
simply presenting the solution without showing the methodology behind it is cheating
people a little. The creators of Kryptos no doubt intended to inspire people to try to solve
it for themselves. Simply showing the "solution" that I have derived steals away a little of
the excitement and appreciation of the problem, and can discourage people from trying
their own interpretations.
However, when asked to write an article for "Studies in Intelligence", I became
intrigued by the idea of trying to explain what can be a complicated and convoluted
subject in a manner that hopefully could be understood by anyone. After it was suggested
to me that it could well be impossible to explain the methodology concisely and in a non-
technical manner, I couldn't resist taking up the challenge.
Where to Begin?
When first confronted with the coded full text of the Kryptos sculpture, the task of
deciphering it can seem formidable�even impossible. Where to begin? Even the most
. casual of observations reveals that the writing on the sculpture is divided into 2 main
pieces. One side (figure 1) depicts a somewhat modified."Vigenere Tableau" (a series of
alphabets used for the coding and decoding of text); the other side contains the actual
coded message of 866 characters interspersed with four "question marks" (figure 2). .
One method for deciphering a code begins by -counting up the number of times that
each letter of the alphabet occurs throughout the message�a so-called "frequency count".
However, it seemed reasonable to me that different sections of the Kryptos code may have
been enciphered with different coding schemes; if so, it would be necessary to perfonn
frequency counts on each part separately. Looking through the code, I seemed to see
4
Approved for Release: 2018/07/23 C06712772 .
Approved for Release: 2018/07/23 C06712772
� Doc ID: .6595020
$
ABCDEFGHIJKLMNOPQRS TUVWX YZABCD
AKR YPT OSABCDE FGH I JLMNQUVWX Z KR YP
BRIPTOSABCDEFGHIJLWNQUVWX Z KRIPT
CIP T OS ABCDEFGHI JLMNQUVWX'Z KRIPT 0
DPTOSABCDEFGHIJLMNQUVWX ZICRYPTOS
ETOSABCDEFGH/ JLMNQUVWX Z KR YPTOSA
FOSABCDEFGHIJLMNQUVWX Z KRYPTOS AB
GSABCDEFGHIJLMNQUVWX ZKRYPTOSABC
HABCDEFGHIJ-LMNQUVWX Z KR YPT OSABCD
111CDEFGHIJLMNQNVWX Z KRIPTOSABCDE
JCDEFGHIJLMNQUVWX ZKRYPTOSABCDEF
KDEFGHIJLMNQUVWX Z KR YPTOSABCDEFG
LEFGHIJLMMQUVWX 2 KRIPTOSABCDE'FGH
MFGHIJLMNQUVWX ZKRYPTOSABCDEFGHI
NGHIJLMNQUVWX VICRYPTOSABCDEFGHIj
OHIJLMNQUVWX ZKRIPTOSABCDEFGHIJL
PIJLMNQUVWX ZKRYPTOSABCDEFGHIJLM
QJLDINQUVWX S KRIRTOSABCDEFGHIJLIIN
RLMHQI7VWX ZKRYPTOSABCDEFGHIJLMNQ
SXNQUVWXZ KRYPTOSABCDEFGHIJLMNQU
TNQUVWX Z !CRYPT OSABCDEFGHIJLMNQUV
UQUVWX ZKRYPTOSABCDEFGHIJLMNQUVW
^UVWXZKRIPTOSABCDEFGHIJLMNQUVWX
WVWX ZKRYPT OSABCDSFGHIJLMNQUVWX Z
XWX EICRYPTOSABCDEFGHIJLMNQUVWX Z
YX Z KRYPTOSABCDEFGITI JLMNQUVWX Z KR
� 21CRYPTOSABCDEFGHIJLMNQUVWX
Figure L One Side of "Kryptos" Sculpture, Depicting Vigenere Tableau
EMUFPRZLRFAXIUSDJKZ4,DICRNSIIGNFIVJ
IQTQUXQB�QVIUVLLTREVJYQINKIRDMFD
^FPJUDEERZWETZTVGWHICKQETGFQJNCE
GGWHICK7DQMCPFQZDQHMIAGPFXHQELG
T IMVMZJANQLVKQEDAGDVFRPJUNGEUNA
QZGZLECGYUXUEEN�TTBJLBOCRTBJDFIIRR
� ETICZEMVDUFICSJIIKFWEICUWQLS.Z FT I
HI(DDDUVH ?D�47KBFUFPWNIDFIICUQZ ERE
EVLDKFEZMOQ-Q3LITUGSYQPFEUNLAVIDX
FLGGIEZ ?FICZBSFDQVGOGIPUFXHHDRKP
FHQNTGPUAECNUVPDJMQCLQ.UMUNE.DFQ
EL Z ZVIIRGKFFVOEEXBDMVEINFQXE ZLGRE
DNQVMPNZ GLFL.PMRJQYALMGNUVPDXVKP
DQUMEBEDMHDAPMJGZNUP,LGEWJLLABIG
ENDYAHROHNLSRHEOCPTEOIBIDYSEINAIA
CHTNREIULD,SLLSLLNOHSNOSMRWXMNI
IPRNGATIHNRARPESLNNELEBLPI /ACRE
WMTWNDITIEENRAHCTENEUDRETNHAEOE
TFOLSEDT IWENHAEIOTTEWEENCTAYCR
EIFTBRSPANHNEWENATAMATEGYEERLB
TEEPOASFIOTUETUAEOTOARMAE ERT.NRII
BS EDDNIAAHT TMS ME, IHROAGR IEWP1313
ARCIDDHILCE IHSITEGOE AOSDDRIDLOR IT
RICLMLEHAGTDHARDPNEOHMGFI4F SURE
ECDPIRIPFE IMEHNLSSTTRTVDOHW7OBKR
110XOGRULBSOLIFBBWFLRVQQPRNGICSSO
TVITQSJQSSEKZ ZWATJKLAIDIAWINFBNIP
^TTM1Z FPICNIGDICZ XTJCDIGKUHUAUEICCAR
ligwre 2. Opposite Side of "Kryptos" Sodpture, Containing the Coded Message
5
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID:6595020
�
different patterns throughout, but I wanted to quantify these impressions. Therefore just
as a starting point, I decided to count up the number of times each letter in figure 2
occurred in each row of the message. By plotting these counts as a function of row for
each letter of the alphabet (26 plots in all), I would be able to watch how often each letter
was being used as the message evolved. In particular, if the count .stayed approximately
constant for a number of rows, this would indicate the same type of code was being used
for that part of the message.
� A typical example of one of the 26 plots, for encoded letter 7", is shown in figure
3. (Of course, these "Ps are not really "Ps at all, but are ciphertext letters representing
plaintext letters of the alphabet.)
Figure 3. Frequency of "J" Occurrences by Row
It can be seen that the letter "J" occurred 2 times in the first row of the ICryptos message,
1 tine in the second row, and so on. I noted that there was a marked 'change in letter
frequency occurring between rows 14 and 15; that is, from row I to 14 there were Ts
appearing in almost every row, but from row 15 to row 25 there were no Ts appearing at
all. It will be hown later on exactly what is causing this phenomenon; the important
point to me was that I saw a good indication that rows 1-14 were encoded with a different
6
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID:�6595020
�
type of code than rows 15 and beyond. (There was also an indication that the last 2 or 3
rows were encoded with a different type of code than the preceding rows.) The dramatic
change from row 14 to 15 was seen in virtually all of the 26 frequency plots; two more
examples are shown below in figures 4 and 5 (for letters "Q" and �K", respectively).
Am7T:17:r17gRF.
:'11111111111111111111111
,%4:1 Rhin GIMinilifiritt
Figure 4. Frequency of "Q" By Row
i01111111111111111
1r 1 1, 1111111111111105
-41h 1 it
Figure 5. Frequency of "K" By Row
Based on these results, I therefore divided the code into 2 sections; rows 1-14 were
designated the "top" section, and rows 15-28 the "bottom". I then further divided the top
section into 3 parts using the four question marks as the dividing points; I designated
these portions as Parts I, 11, ancLBI respectively (figure 6). I began my attempts at
deciphering with the 125 characters of Part II because this piece looked more interesting
to me than the other two parts. �
EFIV,EPHZT_RFX7USL,ZKZLDFFUSHGUFTVZ:
^o:TCUNCS.aVY:.-VI.LiREVZYT:4KIRDMFD
^FFJVZCENZWETZYVqwMPCKOET*FCZKCIE
GGWEINEPDONCRFIVIDOMMIAORFICUORLO
TxxvidzsAmoxvmestpaeovra VVVVV uaa
02SOELICOTOZVEKUMJLSQCRTI ZZZZZ
1[TxxxszasmvourksJuiriuguwassmx
REDDOUVEVDWICHFUFPWNTDFIYCUQZERE
EVLDXF22.14000OLTTUGSTerFEVNLAVIDX
FLGGTEMK2BSFD0VGOGIPUFXHHO2i:r
BIFHONTOPVAECHUVPDJMOCLOUMUNEDF.2
ELZ=VER6KFFV02EXH0MVPMFOXE2L6R�
ONOEMPUZGLELFMRJOYALHGNUVFOXVKP
:�1.114ESEDMHDAFMJGZUUELGSWJLLAET6
Figure 6. Top Section of ICryptos Code, Divided into 3 Parts
7
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
Encryption Schemes
� Encryption schemes are methods of changing an original plaintext message into a
coded one. Although there are many different' types of encryption methods, virtually all of
.
them fall into two main categories: substitution codes and transpositional codes.
Substitution Codes: Each letter of the plaintext message is changed into another
letter of the alPhibet. In a simple, monoalphabetic substitution (i.e using a single '-
alphabet), a particular letter will be encoded by the same letter every time it is used.
Exanple:ABCDEFGHIJKLMNOPQRSTUVWXYZ
meritabcdfghjklnopqauvwxyz
So "The Red Badge of Courage" would be encoded: "set pti emibt la riupnbt" using the
keyword "merit".
However, if a polyalphabetic substitution is used (i.e. one using multiple
alphabets), then a plaintext.letter can be encoded by a number of different letters. One
common polyalphabetic method is the so-called "Vigenere Tableau".
173:011722312
1P'SHIJ
OZI
Ve115
witlf)TIA A CD
5.
IA
1 AZ
0 TTTTTTTT T AA CO
VVX AAAAAAAAA Z
II
GI AAAAA 0
IJXXIES PO
TZAACDIPSAI
HI J11.11110PGROTOVVIT
Example: Key: , ABLZABLEABLEABLEAB�
Plaintext: What.hathGodWr ought
Ciphertext: wil2chbelgpoarpfichtz
Note plaintext "W" stays "W" in the first occurrence, but changes into "A" in the second.
Transposition Codes: All of the letters used in the coded message are exactly the
same as those used in the plaintect, but they are arranged in a different order.
8
Approved for Release: 2018/07/23 C06712772
� Approved for Release: 2018/07/23 C06712772
Doc ID: '6595020
Frequency Counts
The frequency count is one of the cryptanalyst's most powerful tools. By
computing how often each letter appears throughout the message, it is possible to
determine important clues about the code employed. In figure 7 is plotted a typical
frequency count of normal English text.
Alphabetic Letter
Figure 7. Normal Frequency Distribution for the English Language
Each bin represents the number of times that that letter occurs, on the average, for every
1000 letters encountered. For example, as you are reading these lines, the words I am
using are unavoidably being constructed of letters that comprise such a distribution. So
tenaciously does this pattern adhere to our language that it is virtually impossible to write
or speak without it betraying its presence. And even if one were to artificially construct a
few sentences or paragraphs that do not follow this distribution, it would turn out to be so
contrived that new patterns would inevitably develop. So because it is an essential and
unavoidable part of our language, from a cryptanalytical point-of-view; the pattern is also
a code's greatest weakness.
9.
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: .6595020
In figure 8 a frequency count for Part II of the Kryptos code is plotted. It was
easily seen, from comparison with figure 7, that the pattern was very different from the
normal distribution for English.
:����
Figure 8. Frequency Count for Part U of Kryptos Code
In particular, the distribution appeared inuch flatter. This is exactly what I would expect
to see for a polyalphabetic substitution code, where the distributions for several different
alphabets would tend to "average out" when combined. Because the modified Vigenere
Tableau�a polyalphabetic substitution code�is inscribed on the Kryptos sculpture, it made
sense to try this first as a working hypothesis for this part of the code.
Finding the Length of the Key Word
A common method for breaking a Vigenere code involves first determining the
length of the keyword that was used to encipher the message. The code can then be
broken up into its .constituent single alphabets (or "monoalphabets") and then analysis can
be performed on each cipher alphabet to determine to which Vigenere alphabet it
corresponds. Once these Vigenere alphabets are determined, the code can be easily.
deciphered. Note that nowhere in this analysis is it necessary to actually resolve the
content of the keyword.
10
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: -6595020
. .1
In order to ascertain the length of the keyword used in Part H of the cipher, I
needed to make use of a cryptanalytical tool known as the "index of coincidence", or I.C.
This concept conveys the probability that, given a distribution of letters, any two of them
chosen at random will be the same. The details are covered in the field of statistics, and
they are not significant here; the formula and an example calculation is provided, (see
box), if if anyone wants to repeat the analysis for themselves. The. important point is that for
any set of letters, the average value of the LC. will range from 0.38 up to 0.66. The closer*
this average value is to 0.38, the more likely it is that the set of letters is completely
random. If the value is closer to 0.66, then it is more likely that the letters represent a
monoalphabet.
I first divided the text of Part Ilinto 2 single alphabets and computed the average
LC., then divided the tact into 3 alphabets and again computed the average I.C., then
divided into 4 alphabets, and so on. Finally, I plotted each average I.C. as a function of
the number of alphabets (figure 9).
0
.e
:12
5
me
- . .
......
.....
.......... ��
.......
...
�::
...
Number of Alphabets sr
Figure 9. LC. vs. Number of Alphabets for Part 11
1 2 3 4 3 67 8
DQMCPFQZ
DQPINIAGP
FICHORLGT
IMYPIZJAN
QLVKQEDA
GDVFRPJ1.1
NGEDNAQZ
GZLECGYU
XUEENJTB
JLIIQCRTB
JI/VIIRRYI
ZETKZEMV
DUFICSJHIC
FINHKUWQL
SZETIHAD
ODUVH7
Figure 10. Part 11 of Kryptos
Code Divided into 8 Alphabets
It is easy to see from this figure that the correct key length for this piece of code should be
8 since that number yields an average I.C; value of almost 0.063; thus, I knew that I
needed to divide the code into 8 separate alphabets. (figure 10)
11
Approved for Release: 2018/07/23 C06712772
�Approved for Release: 2018/07/23 C06712772
Doc ID:�6595020
Example Computation of I.C. for 7
Alphabets (Kryptos Code Part II)
0.038
Completely
Random
Letters
0.066
Mono-
alphabet
f=letter frequency, N=number of letters in column
1
2
3
4
5
6
7
1234567
AO
0
1
0
2
0
1
NO
1
1
0
1
0
0
DQMCPFQ
C 0.0 V
1
1
0
1
ZDQMMIA
D2
2
1
1
1
1
1
GP FXHQR
NO
1
2
2
1
1
0
F 1
1
2
0
0
2
1
LGTIMVM
3
1
0
0
0
2
0
II 0
1
0
0
2
2
2
.ZJANQLV
KQEDA.G.D
0
0
0
2
1
1
4
VFRPJUk
.7 0
K2
1
1
1
1
2
0
1
0
0
1
1
0
GEUNAQZ
L 1
0
1
1
0
1
1
GZLECGY
Di 0
0
1
2
2.
0
1
UXUEENJ
0
0 0
0
0
0
0
2
0
0
0
1
0
1
0
TBJLBQC
P 0
1
0
1
1
0
0
RTBJDFH
Q 0
2
1
0
1
4
1.
RRYIZET
R2
1
1
0
1
1
0
0
0
0
0
0
1
0
KZEM.V�DU
Ti
1
1
1
0
0
1
FKSJHKF
V 1
0
2
2
0
1
1
WHKUWQL
V 1
W1
0
0
0
0
0
0
2
1
1
0
1
0
0
1
0
1
0
0
0
DDDUVH
Y 0
0
1
0
0
0
1
2
3
0
0
1
0
1
Alphabet 1:(2(1)+3(2)+2(1)+2(1)+2(1)]/(18)(17)=0.046
Alphabet 2:(2(1)+2(1)+3(2)]/(16)(17)=0.033
Alphabet 3:[2(1)+2(1)+2(1)]/(18)(17)=0.020
Alphabet 4:[2(1)+2(1)+2(1)+2(1)+2(1)+2(1)]/(18)(17)=0.040
Alphabet 5:U(1)+2(1)+2(1)+2(1)7/(18)(17)m. 0.026
Alphabet 6:R(1)+2(1)+2(1)+4(3)1/(18)(17)=0.059
Alphabet 7:(2(1))/(17)(16)=0.007
AVERAGE I.C.:
0.046+0.033+0.020+0.040+0:026+0.059+0.007J/7
=0.033
12
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID:�6595020
Which Vigenere Alphabets to Use?
Now that I had the code divided into 8 monoalphabets, I needed to determine
which Vigenere alphabet corresponded to each of them. If the text of Part II had been
much longer, the analysis would have been fairly straightforward; I could simply have
. performed a frequency count for each column and matched the resulting distributions to
the English frequency count in figure x. The letter occurring most frequently Would most
likely have corresponded toplaintext "E", and, since the Vigenere alphabets have a fixed
order (cyclical permutation), the identities of the other letters could then have been found.
However, from the example presented in figure 11 (for the first column), it is obvious how �
impossible this method would be for the present problem:
Figure 11. Frequency Count for Mat Alphabet of Fart 11
With only around 15 letters available per alphabet, there are simply not enough to �
determine any kind of alphabetic structure such as that seen in figure 7. So now what?
I must admit that I got stuck at this point for a long time. No doubt a professional
cryptanalyst would know several ways to proceed, but I was unsure. And then one day�
February 21,1998 to be exact, I had a breakthrough. How well I remember sitting at my
desk, with the sun coming through the window and the birds chirping loudly outside. I
13
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
a Doc. ID: '6595020
don't know if it was divinely inspired (it certainly felt that way), or if simply all of the
knowledge that I had gained about the ICryptos code from hundreds of hours of work
came together and combined with what I had learned from all of the books I had read on
cryptography. In any event, everything suddenly seemed so very clear that 1 didn't have
the slightest doubt about how to proceed, and I was confident that it would work.
This is what I did: Once again I -divided the message into 8 separate alphabets..
Now, what had become plain to me was that if I wrote out one of the columns along with
every possible permutation for each letter in that column, then exactly one of these would
contain the true plaintext letters. True, the Message would be sampled by every 8 letters;
but I could write out the permutations for every column and then look for likely letter
combinations among the plaited (figure 12).
BEFGHIJI�MNQ�UVNICSKRYPTOSAB
BEFGHIMNQUV.WWWTOSAB
FOR IJLMNQUVWXZKRYPTOSABCD
I�71.141NQUVNXZKRYP TOSABCDEFG
QUVWXSICRYPTOSAB.CDEFGHIJLI4
OHIJLMNQUVINIXSKRYPTOSABCDB
IRQUVWX ZICRYP TOSABCDEPGHIJI.
OHIJLMNQUVIPX ZKRYPTOSABCDE
XLICR-YPTOSABCDEFGHIJLNNQUV
JLMNQUVWX ZICRYPTOSABCDEFGH
JLMNQUVWXZKRYPTOSABCDEFGH
EICR_YP.TOSABCDEFGHIMNQUVN
DEFGHIJLMNQUVOIX SKR YPTOSAB
FOR IJLMNQUVWXZKRYPTOSABCD
ISABCDEFG.HIJLMNQUVICXZKRYPT
DEFGHIJLMNQUVillXZ ICRYP TOSAB
figure 12. First Column of Part II With Every Possble Pennutadon
One of these columns must correspond to the correct plaintext letters for the first
Column of the message in figure 10, but which one?
14
Approved for Release: 2018/07/23 C06712772
Approved for Release: 201.8/07/23 C06712772
Doc ID: 6595020
DEFGHIJLPINQUVWXZKRYPTOSABC
DBFGHIJLMNQUVWXZKRYPTOSABC
FGHIJLMNQUVWXZKRYPTOSABCDE
I3LMNQUVWXZKRYPTOSABCDEFGH
QUVWXZKRYPTOSABCDEFGHIJLMN
GHIJLMNQUVWXZKRYPTOSABCDEF
NQUVWXZKRYPTOSABCDEFGHIJLM
GHIJLMNQUVWXZKRYPTOSABCDEF
XZKRYPTOSABCDEFGHI3LMNQUVW
JLMNQUVWXZKRYPTOSABCDEFGHI
3LNNQUVWX5KRYPTOSABCDEFGHI
ZKRYPTOSABCDEFGHIJLMNQUVWX
DEFGHIZLNNQUVWXZKRYRTOSAB-C
FGHIJLMNQUVWXZKRY.PTOSABCDE
SABCDEFGHIJLMNS).UVWXZKRYPTO
DEFGHIJLMNQUVWXZKRYPTOSABC.
, Mg. 13. Permutations of First Column, with Uncommon Letters in Red
Looking across the columns (figure 13), it can be seen that some appear more
promising than others; those that contain a large number of uncommon letters, for
instance (remember, these should now represent actual plaintext letters.) But this all
seemed so subjective�and how could I tell which column was the best choice? Columns
1, 5, 7, 11, 15, and 16 each contain at least 5 uncommon letters�very unlikely to occur in
such a short message of only 125 characters, so I could rule these out. But What about
the others? Column 18, for example, contains 4 "It"s, which is a very common letter, and
only 1 "J".(an uncommon letter.) Bin is that .column more likely to represent the plainttxt -
letters than column 22;which has 2 "E"s and 4 "0"s, and no "K"s, "J"s, or "Z"s at all?
What I needed to do was to quantify these observations mathematically. One way
to do this would be, for each column, to add up the normal English frequency count
associated with each letter. Then the columns with the highest sums would be the best
candidates to correspond with the true planed letters. Starting with column 1 for
example, it can be seen from figure 7 that letter "D" occurs 4.4 times (on the average) for
/every 100 letters in English, "F" occurs 2.8 times, "I" 7.4 times, and so on. I could have
15
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
�
simply summed these up; however, in my studies I learned that it is actually better to
compute the sum of the logarithm of the frequencies instead. Thus for the first column,
log (4.4) + log (4.4) + log (3.8) + log (7.4) + ...=7.3. One advantage of using the log of
the values rather than just the values themselves is that the overall sums will be
"penalized" for containing the uncommon letters B, J, K, Q, X and 4; i.e. those with
negative log frequency values, and will more dramatically reduce the overall score. The
final log sums for each column are presented in figure 14 -(the table has been turned
sideways for ease of presentation; the rows should correspond to the columns of figure
13.)
DDFIQGNGXJJZDFSD
7.3
BEGJUNQHZ ILK 8 GAB
13.0
'FFELVIUIICNKRFEBV
16.3
GGINWJVJANNIGICG
12.8
HEJNICLWLY'sQQPIIJDH
6.4
I ILQZMXI4 PUUT ILE I
16.2
JJMUKNZNTVVOJMFJ
2.9
LLNVRQKQOWNSLNGI
12.8
NNQIITURUSXXANCIIIN
10.1
NNUXPVTVAZ Z BRUIN
11.4
QQVZTWPWBKKCQVJQ
�5.6
UUNKOXTXCRRDOWLU
14.8
VVXRSZ 02 DTI ZVXMV
7.3
WWZTARSKEPPFWZNW
7.0
XX KPBRARF TTGXKQX
7.0
Z Z RTCYBYGOOKZRU-Z
6.9
RRPSZTD"TIAAJRPWR
25.2
TT TAFOZOJBBLITX
16.1
PPOBGSFSLC.CMPOZ P
15.6
TTSCHAGAMDDNTSKT
23.7
00A0 INIIIINEBOOAR0
24.8
SSB H JCICQFFUS13 It 5
13.4
AACFLDJDWGGVACPA
17.4
B B DGMBLEVEHNBDTB
16.2
CCERNFMFNIIKCZOC
.21.9
Figure 14. Log Sam Frequencieslor Each Column Permutation
Again, the details of these calculations are not really important�the main point is that the
� rows in figure 14 with the highest values are the most likely to correspond to the correct
plaintext letters.
16
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID:6595020
� � �
Finally, Words Start to Appear
It is easy to see from figure 14 that the three highest log sum values correspond to
the "R" row (log sum=25.2), the "T" row (log sum--23.7), and the "0" (log sum=24.8).
These three values are significantly higher than any a the others. Now, I Often imagine a ,
� professional cryptographer with stag of special tools, not unlike a consummate locksmith
or doctor, but consisting of alphabetic letter tables and Charts rather than picks or scalpels.
� .The English language frequency chart and the LC. were such tools, and now another one
comes into play namely, the freciuency table of initial letters common in English language
words. In other words, how likely is it for a particular letter to begin a word. It so
� happens that the letter NO occurs as an initial letter an average of about 7.2 times per 100.
words, and the letter "R" only about 3.1limes. However, since the letter mr ocxans a
whopping average of 16 times per 100 words, this is deafly a good letter to by first.
Knowing that one of the most common words in English is the word "THE", and
� given that the first letter of Part 11 could very well be a 'Pr, I naturally wanted to see what
would happen if "H" were the second letter and NEW the third. But once I chose these
letters, I would then be committed to using all of the other letters in those rows as well.
The permutations with log sums for the second and third columns of figure 10 are
presented in figures 15 and 16, respectively.
17
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
. .
QQXML
UUZNN
^VKQN
WWRU0
X XYVU
Z.ZPWV
KKTXW
RROZX
YYSKZ
PPARK
TT.BYR
O0CPY
SSDTP
AAEOT
BBFSO
CCGAS...Z.
DDHBAK
EEICB'R
FFJDCY
GGLEDP
HEMFET
II.NGFO
J.J0HGS
LLUIHA
MMVJIB
NNWLJC
0
A
ZULDEUW
KVMEFVX
RwNFGWZ
YX0GHXK
PZUHI ZR
TKVIJKY
ORWJLRP
SYXLMYT
AP ZMNPO
BTKNQTS
CORQUOA
DS YUVSB
EAPVWAC
FBTWXBD
GCOXZCE
HDSZKDF
IEAKREG
JFBRYFH
LGCYPGI
MHDPTH.7
NIL TOIL
QJFOSJM
ULGSALN
^MMABMQ
WNIBCNU
X0.7CDQV
0
A
V
T29. 4
0
A
MM
NN
QQ
^U
^v
WW
XX
Z Z
KK
RR
Y Y
PP
TT
O0
SS
AA
BB
CC
DD
EL
FT
GG
II
.1J
LL
T.)
0
A
V
X
0
A
V
X
0
A
N.
V
X
0
A
V
X
2
0
A
0
A
0
A
0
2
0
A
0
V
X
0
A
0
A
0
A
HF
IC
JH
LI
NJ.
NL
Q
UN
^ Q
WU
XV
ZW
V
X
0
KXA
RZB
YKC
PR.D
TYE
OP F
S TG
AOH 30.5
BSI
CAJ
DBL
ECM
FDN
GEQ
ligures15. Probable Plaintext for 2nd Column Figure86. Probable Plalstext for 3rd Column
It was seen that the log sum frequency for the "H" row of figure 14 is 29.4, and for the
"E" row of figure 16 is 303-,certainly fikrong values, indicating that these rows are good
candidates for being the correct plaintext letters. More importantly, when these three
alphabets are lined up, no obvious impossible combinations were seen (figure 17):
1 2 3 4 5 6 7 8
THE
THE
SMA
CFI
HE I
AT I
GA T
AND
MIT
DER
DTO
NO W
TIO
S LA
KNO
TTH
Figure 17. Probable Plaintext for First 3 Columns of Part 111
18
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
4 t.
What! was looking for here were contradictions�that is, combination of letters
that would not be possible in English, such as "AAA" or a "Q" that was not followed by
the mandatory "U", for instance. Much to my delight, not only were no contradictions
found, there were even heartening signs showing I was definitely on the right track The
word "AND" appeared in row 8, and an indication of the suffix "-TION" started to peek
out from row 13. Best of all, that %NO" in the 15th row was an unexpected gift, since I
knew the odds were extremely good that there must be a "W" following it. So all I
� needed to do to find the next plaintext column was to write out the permutations for the
fourth colunm of figure 14, find the permutation set that contained a "w" in the 15th
position, and add this column to figure 17.
Now that I was looking for logical words, calculating the log sum frequencies was
no longer necessary�I just had to pick out the one row in each set of permutations that
best fit with the already-selected columns of figure 17. What a treat not to have to add up
any more of those log frequencies! (I had done so many of these that, at one point, I had
memorized all of the letter frequencies and proudly showed off this "skiff" to my very
�
patient family, fiends and co-workers.) Continuing on in this manner, finding the
remaining letters for columns 5-8 was not difficult, and the final plaint= of Part II fell
into place:
19
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
� r;
1 2 3 4.5 6 7 8
THEYUSED
THEEARTH
SMAGNET I
CFIELDXT
HEINFORM
AT IDNWAS
GATHER'ED
ANDTRANS
MIT.TEDUN
DERGRUUN
DTOANUNK.
NOWNLOCA
TIO:NXDOE
SLANGLEY
KNOWABOU
TTHIS
Figure 18. Plainted for All 8 Columns of Part II
I noticed a few surprises. First, the letter "X" seemed to be serving as a
punctuation mark in the fourth and 13th rows�probably a period. That could have
confused the decryption if it had occurred in the first few cohmins, but luckily it didn't.
Secondly, I now saw that the first word was not "THE" after all, but "THEY". This was
another bit of luck (or serendipity), since my initial assumption was wrong but it still led to
the right answer. Finally, I noticed that the spelling of "undergroluid" in the 10th row wa..s
'incorrect". I was so disconcerted by this that I made one of my rare trips (only about my
third) out to the ICryptos sculpture to double check my copy. I actually put my hand out
to fed the letter and confirm that I had it correct. But I hesitated to call it an error�it was
possible that it could also have been a purposeful effort by code's author to provide a clue
for interpreting a deeper part of the solution.
The next thing I did was to look at Part III of the code to see if it was encoded in
the same way as Part II. I simply continued out the permutations from figures 14-16 so as
to include the letters from Part III. Surprisingly, I quicldy found readable plaintext
20
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
0 n
forming from Part III, showing that what I was calling "Parts II and III" were really a
single portion of code with a single encryption scheme. Although I wasn't expecting this
to be the case, it was a pleasant shock to get the remainder of the message with almost no
additional work.
When I tried to decode Part I using the same scheme, however, I found that it did
not work. Part I was definitely encrypted differently than the rest of the top section, so I
had to start all over again, first computing the I.C.s under the assumption (which proved
correct) that I was once more working with a Vigenere cipher for this part:
FIgure..19.. LC. is. Number of Alphabets for Part I
Although the graph was cruder than for Part II because it was obtained from a fewer
number of letters (note that some of the I.C.s seem to exceed the theoretical limit of
0.063), it was still obvious that a key length either 5 or 10 was being employed. (These
multiple high LC. values were the result of the way the I.C.s were calculated. Since high
I.C. values are caused by letter repetitions within a colunm, columns split up into multiples
of the keylength (i.e. 5, 10, 15, etc.) will show up as additional peaks at these values.) I
tried both, but it was 10 that proved to crack this part. I performed the same analysis as
21
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
just shown previously for Parts II and III, and the final decryption for the entire top half of
the code is presented here:
BETWEEN SUBTLE SHADING AND THE ABSENCE OF
LIGHT LIES THE NUANCE OF ILLUSION. THEY
USED THE EARTH'S MAGNETIC FIELD. THE
INFORMATION WAS GATHERED AND TRANSMITTED
UNDERGROUND TO AN UNKNOWN LOCATION. DOES
LANGLEY KNOW ABOUT THIS? THEY SHOULD ITS
BURIED OUT THERE SOMEWHERE. WHO KNOWS ITS
EXACT LOCATION? ONLY WW. THIS WAS HIS
LAST MESSAGE. THIRTY�EIGHT DEGREES FIFTY�
SEVEN MINUTES SIX' POINT FIVE SECONDS
NORTH SEVENTY�SEVEN DEGREES EIGHT MINUTES
FORTY�FOUR SECONDS WEST ID BY ROWS.
Figure 20. Completed Plaintext for Top Section of Kryptos Code
So What Does the Bottom Section Say?
Of course, all the time that I was working away at the top section of the ICryptos
code, I would take occasional breaks to look at the bottom section as well. I saw almost
immediately that this section, like the top, was made up of different parts. From the
. frequency by row charts (figures 3-5), theft was a strong hint that the last three lines or so
were encoded with a different scheme than the rest. So I decided to divide the bottom
section into two parts at the question mark,. and called them Parts IV and V.
ENOYAHRoHNLBRHEOCPTE0IBIDYSHNAIA
CHTNRETULDSLLSLLNoRSNOSmRmXMNI
prrpRNGATIHNRARFESLNNELEBLRIIACAE
WMTMNDITIEENRAHCTENEuDRETNHAE0E
TFOLSEDTIWENHAEIOYTEYOHEENCTATCR
EIFTBRSPRMHNEwENATAMATEGTEERLH
TEEFOASFI0TUETUAEOTOARMAEERTNRTI
BSEDDNIAAHTTMSTENPIEROAGRIENFEB
AECTDDHILcEINSITEGOEAOSDDRYDLOR/T
RKLMLEHAGTDHARDPNEOHMGFMFEUHE
ECDMRIPFEIMEHNLSSTIRTVDONN7OBKR
UOXOGHULBSCLIFEENFLRVWFWGKESO
1,TWTQS3QSSEY:ZZWAliKLUDIAWlyrBNYP
VTTHIIPPKWGS'KZXTJCDIGURUAUEY.CAR
Figure 2L Encoded Bottom Section of 1Kryptos Code
22
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
Starting with Part IV, the first thing I did was call out my faithful old friend, the
frequency count:
Figure 22. Frequency Coast for Part N
Comparing this chart to figure 7, it was obvious that the letters in Part IV were occurring.
with the same frequency as they occur in. normal English. This implied that this part of the
code must be encoded with a transposition code (see box) Interesting...the Kryptos. code
(so far) seemed to be encoded with the two most fundamental types of codes�the
substitution and the transpositional.
Because Part IV was probably a transpositional code, I knew that all of the 336
letters were ahead); in plaintext, but I needed to determine their correct ordering. At first
it seemed like an impossible task, with an almost infinite number of possibilities.. After
reading up on the subject, however, I soon realized that there are standard ways to encrypt
a transpositional code, just as there were for the substitution codes. And I had a hunch
that the code's author may have used one of the most fundamental types of encryption.
23
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: ,6595020
Transposition Cypher (Example)
PLAIN :
POURSCOREANDSE
^ENYEARSAGO
1 2 3 4 5 3 2 4 5 /
FCNER NCERF
OODNS DONSO
� SY4 SRYAU
REEEG EEEGR
SAVAO VAAOS
CYPHER: NCERPDONSOGIRYA
UEEEGIRVAAOS
Figure 23. Example of a Basic Substitution Code
In a basic substitution code, the plaintext message usually is first written out
vertically in matrix form, with a certain number of columns and rows; it may or may not
be a square matrix (see figure 23). The columns are then mixed around, and the new
ciphertext is read horizontally from the rows. To decipher the message, the reverse
procedure must be carried out.
Defining the Problem
In order to read the Kryptos transpositiOnal message, then, the first thing that I
needed to do was to determine the basic structure of the array, that is, ascertain into how
many columns and rows the 336 letters were divided. For example, one solution might be
to try 18 columns by 36 rows, since 18 times 36 equals 336. Another solution could be 56
columns by 6 rows. But the array does not need to be completely filled in�it could be, for
example, a 17 x.20 grid, but with only 13 letters in the final row. So how would I know
the right choice?
The big breakthrough took place when I realized that there were really only a finite
number of possible solutions. I thought about the problem this way: suppose I looked at
something a little more simple, say a transpositional message of only 29 characters (figure
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
k 0
24). Now, since I had constructed this problem myself and therefore knew the answer, it
was easy to see the methodology required to solve it.
B-1
IWRROT
WEE UCN
SIODN
NTN FIT
OHTOSE
1 2 3 4 5
I w SNO
WEITH
REONT
RIIDFO
OCNIS
TN TE
4 5 2 1 3
NOWIS
THEWI
NTERO
FOII.RD
ISCON
TENT
NOWISTHEWINTER
OFOURDISCONTEN
Figure 24. A Simple Subsdtadon Code With Array Not Completely Filled In
Now I imagined how. things would look if! only had the ciphertext, without any clues on
how to solve it. I would first need to figure out how many rows and columns there should
be, decide how to break up the original message into "pieces" (i.e. columns) of a certain
length (call this length "B"), and then figure out how many letters should be in each piece.
Once this was known, I would have to assemble the columns into the correct order before
I could read the plaintect.
- Looking at figure 24, it is apparent that, when the array is not completely filled in,
there can only be pieces of length B or B-1, since the shorter words will always be just one
letter shorter than the longer ones needed to fill in the array. .Gradually, I realized that the
mathematical relation should be as follows (defining A=B-1):
Ax + By = 29,
or y-(29-Ax)/B
25
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595'020
,
where xis number of pieces of length A and y is the number of pieces of length B. Since x
and y must be integers, (pieces cannot consist of fractions of a letter), the condition that
there are only a finite number of solutions is forced. So for a given A and B, only certain
y values are possible for each x. For example, if A=4 and B=5:
X
Y
0
5.80
1
5.00
2
4.20
3
3.40
4
2.60
5
1.80
6
1.00
7
0.20
Since y must be a positive integer, there are only 2 possible values for x for this example:
1 and 6.
Now I was ready to try my model on the actual Kryptos� code. Substituting the
number of characters in Part IV into the previous formula,
y=336-Ax/B
I could now determine how many pieces of length A and B were possible to fit into the
336 characters inscribed on this part of the sculpture. I had noted that Part IV began with
the word "END". This could be only a coincidence, but I wondered if it could be a hint by
the code's author that maybe this word represented the final column in the grid. If true,
this woWd imply either a 'grid Made up mostly of colimms of length 3 and 4, or else a grid
made up all of column length 3. From working with the code for so long, I had gradually
developed the strong feeling that the matrix was not very square at all�that is, it consisted
of only a few very long rows. It is always difficult to describe hunches, but, in this case,
my feelings were based on the realization that once the columns were finally assembled,
26
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
(
they would need to be reordered into columns to make horizontal words. And when I
tried possible solutions using long columns, I found so many contradictions that I was
forced to conclude that the columns couldn't be very long.
Finding the Columns
So after many months of trying different ideas, I finally decided to try A=3 and
B=4 as a working hypothesis. But I still needed to know how many words of length 3 and
how many of length 4 there were. From symmetry, I had the feeling that the final three
letters in Part IV represented a three letter word, since I had hypothesized that the first
three letters did. From the previous formula, I knew that there were only certain solutions
that were allowable�, y=84), (x=4, I), y=78)...all the way up to (x112,
y4). That's still 28 different solutions to check, but fortunately the coned choice of
r-78) Was one of the first that I considered:
TOBOWARIII.11113111�IIILLIPCNI
AzaeozorcaLsaasuranyvams
a� Liiiraeliesa&OWZNZaaaaallrele
AIIDNOctionsgazzamirwarros
piasszinsaccransaate�aa�
cirsawasig�MiraTitilli�allAZIla
mars-NAIsaaisautaairzsosoa
sa^ rBDANTralraDLICZADIT.atattoro
II
Walla
�stallavaLliiieraso.
ezzairvirsie %%%%%
DRIALTDDOWTOIEJLiff
Figure 25. Correct (Bat Unordered) Column Arrangement for Part IV
Re-ordering the Columns
Now I needed to arrange the columns back into the correct order. (By the way, I
should mention, if it is not already obvious, I am presenting these steps in a certain order
only for clarity. In reality they were performed haphazardly, and I would often jump back
27
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
. and forth as new ideas came to me.) For this purpose I reached into my now worn
"cryptographer's bag of tricks" one last time and utilized something called a "digraphic
� frequency table". This chart depicts how often, on the average, any two alphabetic letters
occur next to each other. For the first two columns in figure x, for example, the
combination "YO" occurs only 0.64 times per 1000 letter pairs, "Air occurs 0.13 times,
and so on. By summing up these frequencies for each pair of columns, I was able to
calculate which columns were most likely to occur next to each other. The final solution
is presented in figures 26 and .27.
WS SCICSREMRSI EIMIIDITAZ
OZZAL if 11�LaI III Zit EZIPHICA
.1111.1.11110VIIDIRITIVIRIIMSZ Z114111.11
1111011/11D11 PARATII IITIOWLT ell
� eressaeosimmisme so
1111LIA1111111RIPIITI11111 MIR
RD/ zmaosammaaesziress,
managazga orassaalan a sax IT
raosteasuz smaimera soaps
ascameraosse�SCIIIAIIIMICA
III Fill.L11 rvisunc�ansaata VI
111111011
116111111111A1111110
MID IIXIOTIII
TO, WE IDOORWAYW
MOLY MEW= EMMY 1BE RIME CE
TASTE EMS BiatEERED 'ME II3ER
RTC (F 11E MGM1SREM3AID NMI
IREKLIIG WKS I 2411E A 1:11e MEE iN 1BE
LEER IEET EPND CCM RID ZEN MEM ZEE
ME A =BE I INEEFUED THE MEE AV
Haft IN ITE ICIr AIR 113713}G HOME
(MEER ausED TEE EIRE =CR KT
NEMNILY MAUS OF TEE R324 MEM BERM
ECM TEE MIST.CPN 11:17 SZE AM=
Figure 26. Ordoed Columns for Part XV Figure 27. Correctly Ordeaud Text far Part IV
I have been told by people, although I have not checked it myself, that this is a quote from
a Howard Carter book on the opening of King Tut's tomb. Note the troublesome "Q" at
the end�I tripped over this more times than I can remember. When I first looked at this
part of the code, I thought I could use the "Q" to help me solve the message, since I
thought it would absolutely have to be followed by a "U". However, this turned out to be
a false lead (one of many).
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
y
A New Lead?
Even though it was not necessary to determine the keywords used in the
substitution code in order to read Parts I, II and III, I was curious to find out what they
were. It was easy enough at this point�just find the plaintext letters in the top row of the
. Vigenere tableau in figure 1, follow those columns down until the ciphertext letter is
found, and then read off the first letters of those rows for the keyword letters. (By the
way, because the Kryptos cipher actually uses a modified version of the Vigenere code,
the alphabets down the left-hand side and along the top of figure 1 must first be removed
for this to work property.) It turned out that the 8-letter keyword for Part I was
"ABSCISSA", and the 10-letter keyword for Parts ll and III was "PALIMPSEST". I
knew what an "abscissa" was, but this ogler word was not familiar to me I looked in up
in the dictionary, and found that it was "a written document. ..that has been written upon
several times, often with remnants of earlier.. writing still visible.' Very interesting. Is the
cipher trying to tell us that the ICryptos sculpture contains multiple layers of code�written
one on top of the other?
I went back to the LC. calculations for Part I andfound a surprise when they were
extended out to 15 alphabets:
Figure 2& LC. vs. Number of Alphabets for Part I, Extended To 15 Alphabets
29
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
Doc ID: 6595020
Of course, I knew that the peak, at m=10 was caused by the 10-letter keyword, and the
peaks at 5 and 15 are expected artifacts of the keyword (1/2 and 2 times the keyword
length, respectively). But what was this peak at m=13? Whatever it was, it also showed
up in the I.C. plot for Part II (figure 9). Could this be a sign of another code�possibly
one using a keyword of 13 letters?
. And what about Part V of the puzzle? I haven't spent much time on this portion,
but I have already made some headway. There are interesting patterns in here as well, and
I see many avenues of assault. Although this part could well be much more difficult than
the previous pieces ,I am confident that it is not impossible. I doubt that the code's
authors would get much pleasure out of writing an unbreakable code.
Final Thoughts
� I hope at the very least I have inspired some people to study the Kryptos puzzle
and give it a try�there is still much to do. Even the parts of the code that have been
decrypted must still be interpreted for their deeper meaning. There are many pieces to be
put together, and many layers to be peeled back.
� Nothing is more frustrating than reading a ayptography book where the author
easily and in a stmight-forward manner shows how a code was solved. It's a little like
reading one of those books on 'Wow I made a million dollars". The Methods typically
work for that particular set of circumstances, but they often don't work in your particular
case. Similarly, codes have distinct characteristics that frequently require each of them to
be solved with a unique method. Since I didn't see any need to dwell on the Inmdreds of
things that I tried that didn't work, the methodologies that I presented may seem a little
too straight-forward and deceptively easy.
30
Approved for Release: 2018/07/23 C06712772
Approved for Release: 2018/07/23 C06712772
poc ID: 6595029
� I genuinely enjoyed working on the ICryptos ciphers. Certainly professional
cryptographers could have broken these codes much faster, and would have used 'superior
methods. But I doubt that they would have derived as much satisfaction as I have. I
didn't use any computers to decrypt the ICryptos codes�just pencil and paper, some
common sense, and a lot of perseverance. I believe that, when confronted with a problem
hie the Kryptos puzzle, sometimes we need to step back, set aside our computers and
preconceived notions and just think. Ws important to remember that the Internet,
although useful for some applications, doesn't always have the answers; it would have
been of little help in solving the.Kryptos puzzle.
Maybe it's time to start using our minds again before we automatically reach for
our computers.
31
Approved for Release: 2018/07/23 C06712772