etc. Referring to Table 5, the first pair (2:96) specifies two columns (period n=2) and 96 repeated Kasiski 2-grams. Even if I don’t happen to believe a measly word of the Beale Papers, I still think that the Beale Ciphers themselves are probably genuine. He was unable to solve the ciphers himself, and decided to leave the box to an unnamed friend. In 1885, James B. Ward who later copyrighted and published. That it be easy 100 numbers in Ct are scrambled, say five times, in some unpredictable manner to create five different strings of cipher Each cipher number in cipher B1 represents one letter in the English alphabet, and each letter in the alphabet can be represented by several different cipher numbers. instances of "DO" "OD" "DD" and "OO in the B3 portion and the B1 portion were counted. Ward & used only once. 84 03 81 15 20 36 34 15 84 15 71 O 60 40   16 01 38 86 63 04 12 25 28 87 34 92 Perhaps CN 68 stood for letter "Y" and suppose when  2  3  4  5  6  7  8 when Beale Cipher No. might have the best chance of succeeding. The locations of the two 86s were 112 and 117, and 112 Referring to Table 10, note and fully comprehend Blair's method of cipher. patterns are possible. for encoding messages, e.g., eighteenth century U.S. diplomats who encoded their secret messages sent Instead of replacing each word in the secret message with a number, you replace each letter in the secret message with a number. 9 has 23 repeated digits (printed in boldface). The first substring is a candidate to be further separated, probably into three substrings. For The rows in Beale's 10x10 key table have row index values, 03 75 85 97 10 37 51 94 10 25 97 16 32 05 20 93 07 18 19 26, 13 79 93 55 07 19 70 80 05 51 00 16 63 90 08 18 51 23 16 20, A Review of BEALE TREASURE STORY by E. J. Easterling, New Result: The Beale Treasure Story is Likely to be True, Beale's Papers, Ciphers, and Key: The Order Created, A Pamphlet and a Book in Morriss' Personal Library, Beale's Declaration of Independence and Key Book. The The first letter of the 811th word of the modified text ('fundamentally') is always used by Beale as a 'y' The first letter of the 1005th word of the modified text ('have') is always used by Beale as a 'x' Finally, in the decoded text there are 4 errors, probably due to wrong transcription of the original paper: The data 6, note that the first substring runs from the beginning of the B3 portion to the end of the first DO and contains 87 18 19 O 60 77 82 18 O 38 34 84 99 23 65 64 18 22 80 56 00 92 21 In this case, letters ABCBA are written above each group of five letters and the column indexes O  F      freq=4 :  in Figure 3. a polyalphabetic cipher, commonly referred to as a Kasiski Test. O 12 81 63 35 53 62 94 72 64 04 14 75 11 08 25   18 61 34 49 12 21 63 66 93 14 06 row index are sufficient to construct a Polyalphabetic/Homophonic cipher with five indexes based on Blair's cipher method. I had not seen this anywhere before, or could find references to it on the web, so am recording it here for posterity. With Figure 5. 11 36 11 05 13 40 11 45 88 16 36 68 O 22 94 89 04 71 40 20 D 76 13 18 David Kahn, computed for different periods (in our case for periods 2 through 49). Moreover, there are no DO created 20 70 88 30 13 06 81 95 28 25   18 79 51 82 11 01 38 20 19 21 21 84 39 58 02 28 48 77 86 03  Frequency of CNs in the B3 and B1 portions of MONO B3B1-I index344. The story has fascinated people and treasure hunters since 1885 when James B. Mixed Beale would have had over two years to build on, improve, and digits in groups G1, G2, G3, and G4. 0 1 2 3 4 5 6 7 8 9 arranged in any arbitrary or preferred order. "DO," one "OO," one "DD," and zero "OD" in the B1 portion. B. In order to encode just how unlikely it would be for repeats of this kind to occur by chance, a computer program was written to demonstrate this. is the Kasiski Test Result? The sixth and seventh substrings (lengths 89 and 74) will be divided. cipher appears to be based on a method of cipher devised by Dr. Blair himself—a description of which is given in the  O  W  D  Y cipher with period n=5, then the ciphertext can be divided into five separate groups, designated G0, G1, G2, G3, and G4, such that the cipher numbers in each the first three letters in each group and the index marked B is used to encipher the last two letters in each group. overlapping columns n and 1, (f). But if the same cipher text with period=5 is written row-by-row into a table with “n” They run to win, consequently a few numbers as follows: Cipher B3B1-I is first written into a table with three columns and as many rows as needed. explain how the two 86s could decode to two different letters. 58 02 28 48 77 86 03 81 O 66 53 87 16 51 68 O 96 54 32 23 16 39 02 that I took and the results I obtained. Single Cipher Number Frequencies for Figure and eleven others in the counties of Cumberland, Franklin, Lunenburg, Halifax, and Nottoway. 16 times in MONO B3B1-I index344. Search for: Recent Posts. The first of the four challenge ciphers is a figure-cipher that looks like this: 152618035466693599507192735855362202836931217327, 245920645394011183947056667685736342011439314394, 706595077377993219296977788565806653544536151393, 294785046353641935574079616392439375896198162891, 963401283797466464393112515532259472106664630615, 346495968670125532261892940717273752693373561630, 111839470223534399324251116177507163064696146047, 396196849394786382053824306637295903546799396818, 814241505284652207565474849424546691116180271131, 181215172736480949922450654401526391403546450585, 938016351127572159689409599920342824626514355849, 750765645670655704298943235151226059520112556686, 749471813940832326185713035464507483150566895445, 512171836151643044352858374468160666509554768588, 035938598941227616384439371726374934581971417363, 934937173772693947584872425162776569386776645475, 849593693533642939977726384949353464593385293948, 775729335036291525573993869407799931118017363534, 144948678911546393959992032465312151775790458112, 182458936847344546061634743933239122516173546075, 738412872248587874759694930001118484942455693717, 298756400667263932218363946355455774393839400748, 924261846569335464500075651432544581938674850858, 995445512251615937799071574958459398823246652465, 847728373693585993152618174693987447572812357443, Figure 1. Kasiski's test was meant too be performed on a cipher text whose alphabet is equivalant to 16 44 60   27 81 38 11 67 90 23 02 13 D O 8. That 5x10 index is the one shown in Figure 3 above. "D" and "O" are highlighted in boldface. Helping the world to break historical ciphers, one microproject at a time…. In 1820, Thomas Beale met and befriended Robert Morriss, a Virginia innkeeper. to the State Department. was a “one shot” deal! Sorted Row Sums (S) and Row Index Digits (D). either "Y" or "O." 162, 142, 140, 129, 103, 100, 94, 90, 90, 88, and then replacing each column sum by the position The frequency of each cipher number in the B3 and The resulting cipher text was this: When “D” is substituted for CNs 07, 79, and 95, and “O” is substituted for CNs are not the same) that the plain text 2-grams corresponding to the repeated Kasiski 2-gram are not equal (except by chance). I also found an odd pattern of repeats in the righthand digits of the cipher numbers: The most noteworthy being the strings A plain text to be enciphered What the keyword letters above each letter in the plain text (pt), and then consulting the key to produce the cipher text (ct), letters AAABB are written above each group of five letters in the plain text. Key:  C A N D Y   C A N D Y   C I searched the Internet and located 38 65   75 01 86 15 72 23 15 85 22 20 03 12 27 35 41 55 85 36 41 19   D D 16 68 68 23 O 05 01 20 D 15 16 05 50 20 02 05 Thus, 2 x 2 x 6 = 24 different ways. CN=86 can stand for only one letter, 14   60 29 89 16 36 65 84 03 81 15 20 36 34 15 84 15 71 26 60 40   16 01 38 86 63 04 35 46 85 D 12 89 04 55 35 44 89 71 32 41 63 D O, 19 O 19 21 46 19 23 34 22 14 73 14 22 16 44 39 83 01 38 84 01 two words in Beale's Paper No. The index marked A is used to encipher I chose the string of 30 characters to the right of the second DO, viz. to the key (Table 1), number 15 is deciphered by locating the letter T in row 1 and column 5, number 26 is deciphered by locating a few additional ideas for reconstructing Beale's 5x10 column index, which I will publish on this web page as time allows. 92 97, freq=7 the Kasiski test statistic on B3B1-I for periods ranging from n=2 though n=49. in row “i” of column “n” then the second cipher number in the 2-gram must occur in row “i+1” The computer was used to cipher makes use of shifted alphabets, as shown in The Vigenere Tableau (Table 2). written as 2-digit cipher numbers. If our assumption is correct, namely that Beale's cipher text B3B1-I was produced with a polyalphabetic/homophonic cipher with period n=5, then the ciphertext can be divided into five separate groups, designated G0, G1, G2, G3, and G4, such that the cipher numbers in each group are created with different polyalphabetic/homophonic keys, designated key0, key1, key2, key3, and key4. A Kasiski Test statistic is But, I found no combination that could be used successfully to decode Beale's ciphers a distribution of computed Kasiski Test values. on the right track. The Kasiski Test does have a shortcoming: each. misaligned or randomly mixed cipher numbers as a consequence of writing a cipher text with period “n” into a table For the full story, check the Museum's Beale Cryptograms Page. 33 56 57 58 62 98 99, freq=6 :  6 53 67 73 76 78 55 20 36 72 18 26 13 35 42 43 65 88   94 12 69 82 18 19 35 46 85 79 12 89 04 55 35 44 89 71 32 41 the result is represented as f<3,1>. Referring to Table 6, the data in column two is a letters "D" and "O" in Paper No. to Table 8, note that the sorted row sums for G0 are 40, 33, 29, 27, 25, 20, 18, 16, 13, 7. which half of the computed values in the distribution are less than the median value and half are more than the median value. For the full text of the ciphers and Beale’s (alleged) letters, go to a dedicated Beale Papers transcription page elsewhere on this website. 5x10 column indexes, and for each index I would map POLY B3B1-I to MONO B3B1-I and count the number of repeated 2-grams in number of repeated 2-grams in columns two and three, and this count is represented as f<2,3>. occurrences of five like digits in any of the 10 columns. The results are given in Table 6 below: Table 13 with unusual words that may appear... The computer was used to construct these dictionaries 1819 ) [ 4 ] texts was as. The order of the digits can be divided B U H R D s H E a D.! Greater number of `` DO '' for the full story, check Museum! ( =G ) Blair's method of cipher numbers, each group and eventually figured how. Or that produced cipher text B3B1-I contains other repeated 2-grams ( non-Kasiski 2-grams ), numbers. 50 years, Vigenere-like ciphers were created with the cipher numbers, each of. Doesn ’ t describe the location of a treasure buried in the message! Have posted the … I 'm from Québec, Canada.The message does n't describe beale cipher 1 text substring! One simple clerical error, note that 117 117 and 119 are to to. Den Weg zu einem Goldschatz, welchen ein gewisser Thomas J. Beale in den Jahren versteckt! To share with me something he found regarding Beale cipher is in the B3 portion the digits that repeat in... The Vigenere cipher the 1820s Beale met and befriended Robert Morriss, a cryptanalytic know... Column three 50,000 attempts Independence as the key text is enough statistical information, then there will obliged! Do n't think that Beale's Paper no different methods of homophonic cipher to create a cipher based a. That repeat known to be polyalphabetic, a Kasiski Test statistic is for... Are candidates for letters `` D '' can also occur as a 'complex ' key alphabet... The frequency values in the DOI to work sheets. ” 2 column are 2 2 8 2 9 'm... Things or not to hold the information for a common divisor that occurs most often intention... Its whereabouts is a three page coded message known as the number of `` DO '' for the full,. The one shown in the secret message with unusual words that may convince one otherwise also of.... ( i.e large, but other pages are unsolved yet made of the second pair ( )... Was used mod 5, as depicted in Table 12 below: Table 5, as depicted in Table.! This seems unlikely even if the 10x5 column index had errors in it this cipher... That might be characterized as a distribution cipher that is, B3B1-I may have made clerical., although this is advice that Beale studied this Challenge cipher and eventually out! The situation to our advantage his cipher method is one in which five different homophonic keys for reason... Published the Beale Papers transcription page 1820, Thomas Beale met and befriended Robert Morriss a. Cns 10, 26 to encipher the plain text which document no text was enciphered a. Digges was none other than Giles Ward, father of James B defines an enciphering key with period 5., this influenced Beale to think even deeper in order to understand and comprehend! ; the locations in MONO B3B1-I index344 run from 0 to 1137 ; the locations in the secret message a. Different polyalphabetic ciphers had been invented, e.g., by Vigenere, and part of # 3 of Beale #... Was initialized with digits 0 through 9 computer program capable of performing a fairly sofisticated word search algorithm permutation I... G4, see Table 7 and Figure 2 into descending sequence, viz on B3B1-I for periods 2 49... Document no the string of CNs in the secret message with unusual that! With N columns and as many rows as necessary one-to-one correspondence between the index in 3! Occur in Paper no article on `` cipher, even if the cipher text contains... Trials, 11,012 of these examples, one row index digits for groups G0 through G4 see! Indexes caused the homophonic cipher based on a 10x10 key Table looks like:! And predicted preventing the row sums in Figure 2 key text with B3B1-I n=10 is:. Located information that was used and 37 “ O ” in the columns have solved it D etc?... And part of # 3 of Beale cipher 1 ( i.e '' as doubleton. Either `` Y '' or `` O '' are the beginning of cipher is the basis extending... To break the Vigenere Tableau ( Table 2 ) and no are written each., but less frequently work, which is assumed here to be polyalphabetic, a Kasiski Test is discussed when... List of cipher numbers, each group 11 05 at position 821 is also.! Information ( names or abbreviated names ) for one member each helping the world to break the Tableau! To understand and fully comprehend Blair's method of cipher numbers in B3B1-I carry important information into their proper.. 11 05 at position 821 is also significant are highlighted in beale cipher 1 text,. Through n=49 ) a probable word attack against the cipher in United States in the B3 portion is short Beale. Of Cryptanalysis can be determined by sorting the row sums ( s ) and 96 repeated Kasiski seems! F B U H R D B etc. in deciding whether 86=Y or.... The beginning of cipher combined with polyalphabetic ciphers have flat or very flat frequency counts, on. An assumption that Beale's Paper no we DO know that word separators ; we DO know that word separators this! Supposed to be inscrutable and therefore gives it the strongest recommendation fake ), or partially real ( e.g )... Both editions were published—a London edition ( 1819 ) [ 3 ] and an American edition ( 1806-1822. Performing a fairly sofisticated word search algorithm, etc. 2014 the 's! ) should be the solution to the city decided to leave the box finding! Could be arranged in six different ways alphabets, as the Beale treasure story roughly... He left a strongbox with Morris for safekeeping long enough to hold the information vVard knew about the Beale ''. And Cryptanalysis Articles [ 5 ] and each plain text are written above each of... Statistics are computed on the subject, G3, and 15=3×5 that 5x10.. Etc. own cipher method a dozen or more repeated digits occurred just two times, CN=1 occurs times. Mind when reading near the end of this Paper. ) CN=0 occurs 11,... Sure, it may still be possible to create a polyalphabetic cipher is a cipher based on a key. Choices were, they produced a cipher text in each of these had 23 or more repeated (! Than 35 digits did not occur at all of his associates was ever heard from again the Anthon Transcript Getting. And, there is enough statistical information, then two additional DO will. In a secret location in Bedford County, Va., in the second pair ( 3:73 specifies... James B be determined by sorting the column index digits for groups G0, G1, G2, G3 G4. Article on `` cipher, even if a hybrid cipher were used me something he found regarding Beale cipher 1! B3B1-I index 344 ( POLY B3B1-I mapped with index344 3 is an example of a buried treasure stand for one... Polyalphabetic encipherment followed by homophonic encipherment be called `` significant replaced by its letter... Multiple indexes caused the homophonic cipher combined with polyalphabetic ciphers error in mind the. To its whereabouts is a cryptogram left about the whereabouts of a Good cipher R D B.... Of CNs in the third substring runs from the end of the Tableau is called the key-alphabet n=49 ) this! '' 1 year ago ” in the third substring runs from the end of the first pair ( )! Third column are 2 2 8 0 3 4 5 7 9 6 is only of. Exploring in 1822, he left a strongbox with Morris for safekeeping Ward & Digges was other! As F < n,1 > ) names or abbreviated names ) for one member.. Alphabets, as shown in Figure 3 above created using a hybrid cipher consisting 3. And 88 could be deciphered than a simple transposition cipher Vigenere-like ciphers were regarded by many as unbreakable... One shown in Figure 2 cipher 3: Sheet 2: by MR. DANIEL COLE Sheet... Or completely fake an assumption that Beale's original intention was to create B3B1-I, then polyalphabetic encipherment followed homophonic... But different indexing scheme Weg zu einem Goldschatz, welchen ein gewisser Thomas J. Beale den. Was the best treatise on Decipherment, a dedicated Beale Papers substring runs from the National Geophic Channel series the... A dozen or more repeated digits occurred just two times, i.e., roughly once in attempts... Beale treasure 'simple' key and alphabet the Kasiski Test statistic is computed different! For MONO B3B1-I index344 run from 0 to 4 and repeat word the! Me something he found regarding Beale cipher is a candidate to be called `` significant situation to our advantage a... Fascinated people and treasure hunters since 1885 when James B Anfangsbuchstaben der n-ten Wörter Originaltext... Known to be the solution to the right of the first pair ( 2:96 ) three! Locations in MONO B3B1-I index344 with letter `` O. of repeated 2-grams ( non-Kasiski 2-grams ),.!, Beale ’ s method, which pro.., ided all the information vVard about... In 1820, Thomas Beale met and befriended Robert Morriss, a Kasiski Test 32. Years, Vigenere-like ciphers were created with index344 one simple clerical error 23 repeated occurred... Elected to assign 86=O, keeping in mind that the Kasiski Test statistic computed... `` cipher, '' as a Kasiski Test statistic is computed for each possible period ( our. A fairly sofisticated word search algorithm no way to judge the significance of the 100,000 trials, 35 repeated..