Difference between revisions of "Codebusters"

From Wiki - Scioly.org
Jump to: navigation, search
(Added Pollux and Morbit to list of ciphers that can be used at invitational and regional competitions)
m (I made it better.)
 
(2 intermediate revisions by 2 users not shown)
Line 18: Line 18:
 
     | Website      = https://www.soinc.org/codebusters-c
 
     | Website      = https://www.soinc.org/codebusters-c
 
}}
 
}}
[[Codebusters]] is an event in [[Division C]] for the [[2020]] season and was held as trial event at both the [[University of Wisconsin 2016|2016 National Tournament]] and the [[Colorado State University 2018| 2018 National Tournament]]. It was last held as an official event in [[2019]]. It is also being held as a trial event for [[Division B]] at the [[North Carolina State University 2020|2020 National Tournament]]. In this event, ''up to 3'' participants must decode encrypted messages, or they may be required to encode messages with certain advanced ciphers. Competitors are not allowed to bring any resources to this event, but can bring a 4 or 5 function calculator - '''no scientific or graphing calculators allowed.'''
+
[[Codebusters]] is an event in [[Division C]] for the [[2020]] season and was held as trial event at both the [[University of Wisconsin 2016|2016 National Tournament]] and the [[Colorado State University 2018|2018 National Tournament]]. It was last held as an official event in [[2019]]. It is also being held as a trial event for [[Division B]] at the [[North Carolina State University 2020|2020 National Tournament]]. In this event, ''up to 3'' participants must decode encrypted messages, or they may be required to encode messages with certain advanced ciphers. Competitors are not allowed to bring any resources to this event, but can bring a 4 or 5 function calculator - '''no scientific or graphing calculators allowed.'''
  
==Test Format==
+
== Test Format ==
  
===Format and Scoring===
+
=== Format and Scoring ===
 
Tests are composed of a variety of questions where teams will encrypt or decrypt various code types. The number of questions on a given test is variable, but tests often contain anywhere from 6-24 questions, depending on the difficulty of the questions. The first question of a test is timed, and a time bonus is given for the question based on how quickly it is completed. Points may be deducted from questions based on the number of mistakes found in the answer given. If the answer differs from the solution by only one or two letters, then no points are removed, despite the answer having errors. Each additional error after two errors will result in a deduction of 100 points. The number of points removed from a question through deductions will not exceed the value of the question (meaning that deductions will never result in a question score below 0).
 
Tests are composed of a variety of questions where teams will encrypt or decrypt various code types. The number of questions on a given test is variable, but tests often contain anywhere from 6-24 questions, depending on the difficulty of the questions. The first question of a test is timed, and a time bonus is given for the question based on how quickly it is completed. Points may be deducted from questions based on the number of mistakes found in the answer given. If the answer differs from the solution by only one or two letters, then no points are removed, despite the answer having errors. Each additional error after two errors will result in a deduction of 100 points. The number of points removed from a question through deductions will not exceed the value of the question (meaning that deductions will never result in a question score below 0).
  
====The First Question====
+
==== The First Question ====
 
The very first question is timed - when solved, a team member should signal the event supervisor that they have finished the question, such as raising their hand, shouting "bingo!", or another method determined by the supervisor before the event begins. The first question will be an Aristocrat with or without a hint. Teams will receive bonus points depending on their time, and they may make as many attempts as they want to break the code without any penalties. The timing bonus will be calculated from the start of the event until the question is answered successfully, or until 10 minutes have elapsed, and is calculated with the formula: 4*(600-number of '''seconds''' taken). Teams may still answer the question after 10 minutes; however, the timing bonus is 0. The first cryptogram may also be used as a tiebreaker. Solutions are given full points only if the solution is an exact match or differs by '''only''' one or two letters. Deductions for inconsistencies in the answer to the first question are treated the same as deductions for a non-timed question.
 
The very first question is timed - when solved, a team member should signal the event supervisor that they have finished the question, such as raising their hand, shouting "bingo!", or another method determined by the supervisor before the event begins. The first question will be an Aristocrat with or without a hint. Teams will receive bonus points depending on their time, and they may make as many attempts as they want to break the code without any penalties. The timing bonus will be calculated from the start of the event until the question is answered successfully, or until 10 minutes have elapsed, and is calculated with the formula: 4*(600-number of '''seconds''' taken). Teams may still answer the question after 10 minutes; however, the timing bonus is 0. The first cryptogram may also be used as a tiebreaker. Solutions are given full points only if the solution is an exact match or differs by '''only''' one or two letters. Deductions for inconsistencies in the answer to the first question are treated the same as deductions for a non-timed question.
  
===Question Point Distribution===
+
=== Question Point Distribution ===
 
The amount of points each question is worth will be distributed by the following:
 
The amount of points each question is worth will be distributed by the following:
*An easy question: 100-150 points
+
* An easy question: 100-150 points
*A medium question: 200-300 points
+
* A medium question: 200-300 points
*A hard question: 350-500 points
+
* A hard question: 350-500 points
*A very hard question: 550-700 points
+
* A very hard question: 550-700 points
  
In the case of a tie, select questions predetermined by the event supervisor will serve as a tiebreaker. The tie is broken using the following criteria in this order: score, degree of correctness, and number attempted.  
+
In the case of a tie, select questions predetermined by the event supervisor will serve as a tiebreaker. The tie is broken using the following criteria in this order: score, degree of correctness, and number attempted.
  
===Code types that may be used at the Invitational and Regional Competitions===
+
=== Code types that may be used at the Invitational and Regional Competitions ===
*[[Codebusters#Atbash Cipher|Atbash Cipher]]
+
* [[Codebusters#Atbash Cipher|Atbash Cipher]]
*[[Codebusters#Caesar Cipher|Caesar Cipher (shift cipher)]]
+
* [[Codebusters#Caesar Cipher|Caesar Cipher (shift cipher)]]
*[[Codebusters#Mono-alphabetic Substitution|Mono-alphabetic substitution]] (can use K1, K2, or random alphabets)
+
* [[Codebusters#Mono-alphabetic Substitution|Mono-alphabetic substitution]] (can use K1, K2, or random alphabets)
**[[Codebusters#Messages with Spaces and a Hint|Aristocrats with a hint, spaces, and no spelling errors]] - messages with spaces included, and with a hint
+
** [[Codebusters#Messages with Spaces and a Hint|Aristocrats with a hint, spaces, and no spelling errors]] - messages with spaces included, and with a hint
**[[Codebusters#Messages with Spaces|Aristocrats with no hint, spaces, and no spelling errors]] - messages with spaces included, but without a hint
+
** [[Codebusters#Messages with Spaces|Aristocrats with no hint, spaces, and no spelling errors]] - messages with spaces included, but without a hint
**[[Codebusters#Messages with Spaces and Spelling Errors|Aristocrats with a hint, spaces, and spelling errors]]- messages with spaces and hints, but including spelling/grammar errors
+
** [[Codebusters#Messages with Spaces and Spelling Errors|Aristocrats with a hint, spaces, and spelling errors]]- messages with spaces and hints, but including spelling/grammar errors
**[[Codebusters#Messages with Spaces and Spelling Errors|Aristocrats with no hint, spaces, and spelling errors]]- messages with spaces and including spelling/grammar errors but no hints
+
** [[Codebusters#Messages with Spaces and Spelling Errors|Aristocrats with no hint, spaces, and spelling errors]]- messages with spaces and including spelling/grammar errors but no hints
**[[Codebusters#Messages without Spaces|Patristocrats with a hint]] - messages with spaces removed, and with a hint
+
** [[Codebusters#Messages without Spaces|Patristocrats with a hint]] - messages with spaces removed, and with a hint
**[[Codebusters#Messages without Spaces or Hints|Patristocrats without a hint]] - messages with spaces removed, but without a hint
+
** [[Codebusters#Messages without Spaces or Hints|Patristocrats without a hint]] - messages with spaces removed, but without a hint
*[[Codebusters#Affine Cipher and Modular Arithmetic|Affine Cipher]] - '''encryption only'''
+
* [[Codebusters#Affine Cipher and Modular Arithmetic|Affine Cipher]] - '''encryption and decryption'''
*[[Codebusters#Vigenère Cipher|Vigenère Cipher]] - encryption/decryption only, not cryptanalysis
+
* [[Codebusters#Vigenère Cipher|Vigenère Cipher]] - encryption/decryption only, not cryptanalysis
*[[Codebusters#Baconian Cipher|Baconian Cipher and its variants]]
+
* [[Codebusters#Baconian Cipher|Baconian Cipher and its variants]]
*[[Codebusters#Xenocrypt|Xenocrypt]] (no more than one)
+
* [[Codebusters#Xenocrypt|Xenocrypt]] (no more than one)
*[[Codebusters#Hill Cipher|Mathematical Cryptanalysis of the Hill Cipher]] - either producing a decryption matrix given a 2x2 encryption matrix or computing a decryption matrix given 4 plaintext-ciphertext letter pairs.
+
* [[Codebusters#Hill Cipher|Mathematical Cryptanalysis of the Hill Cipher]] - either producing a decryption matrix given a 2x2 encryption matrix or computing a decryption matrix given 4 plaintext-ciphertext letter pairs.
*[[Codebusters#Pollux Cipher|Pollux]] and [[Codebusters#Morbit Cipher|Morbit]] Ciphers - decrypting Morse code ciphertext encoded as digits and spaces
+
* [[Codebusters#Pollux Cipher|Pollux]] and [[Codebusters#Morbit Cipher|Morbit]] Ciphers - decrypting Morse code ciphertext encoded as digits and spaces
 
given the mapping of at least 6 of the digits
 
given the mapping of at least 6 of the digits
  
===Code types that may be used at the State and National Competitions===
+
=== Code types that may be used at the State and National Competitions ===
*All Invitational and Regional code types
+
* All Invitational and Regional code types
*[[Codebusters#Running Key Cipher|Running Key Cipher]]
+
* [[Codebusters#Running Key Cipher|Running Key Cipher]]
*[[Codebusters#Vigenère Cipher|Cryptanalysis of the Vigenère cipher with a 'crib' (a known plaintext attack)]]
+
* [[Codebusters#Vigenère Cipher|Cryptanalysis of the Vigenère cipher with a 'crib' (a known plaintext attack)]]
*[[Codebusters#RSA Cipher|RSA Cipher]]
+
* [[Codebusters#RSA Cipher|RSA Cipher]]
*[[Codebusters#Hill Cipher|The Hill Cipher]] - encrypting or decryption with a provided 2x2 or 3x3 matrix.  
+
* [[Codebusters#Hill Cipher|The Hill Cipher]] - encrypting or decryption with a provided 2x2 or 3x3 matrix.
*[[Codebusters#Xenocrypt|Xenocrypt]] - '''at least one''' cryptogram will be in spanish
+
* [[Codebusters#Xenocrypt|Xenocrypt]] - '''at least one''' cryptogram will be in spanish
*[[Codebusters#Affine Cipher and Modular Arithmetic|Mathematical Cryptanalysis of the Affine Cipher]]
+
* [[Codebusters#Affine Cipher and Modular Arithmetic|Mathematical Cryptanalysis of the Affine Cipher]]
  
==Code Types==
+
== Code Types ==
  
===Atbash Cipher===
+
=== Atbash Cipher ===
The Atbash Cipher is a variant of the affine cipher (see above) in which both a and b equal 25. This results in the alphabet essentially becoming a mirror (A corresponds to Z, B corresponds to Y, C corresponds to X, etc.).  
+
The Atbash Cipher is a variant of the affine cipher (see above) in which both a and b equal 25. This results in the alphabet essentially becoming a mirror (A corresponds to Z, B corresponds to Y, C corresponds to X, etc.).
 
<div style="overflow:auto">
 
<div style="overflow:auto">
 
{| class="wikitable" style="margin-bottom: 0px"
 
{| class="wikitable" style="margin-bottom: 0px"
Line 141: Line 141:
  
  
====Encryption Example====
+
==== Encryption Example ====
 
Encode "encrypt" with the Atbash Cipher.
 
Encode "encrypt" with the Atbash Cipher.
  
Line 184: Line 184:
 
The cipher text is "vmxibkg."
 
The cipher text is "vmxibkg."
  
====Decryption Example====
+
==== Decryption Example ====
 
Decode "zmhdvi" with the Atbash Cipher.
 
Decode "zmhdvi" with the Atbash Cipher.
  
Line 223: Line 223:
 
The plaintext is "answer."
 
The plaintext is "answer."
  
===Caesar Cipher===
+
=== Caesar Cipher ===
One example of a mono-alphabetic substitution is Caesar shift cipher, where each letter is replaced by one shifted by a certain amount. For example, the following table has each letter shifted three positions to the right.  
+
One example of a mono-alphabetic substitution is Caesar shift cipher, where each letter is replaced by one shifted by a certain amount. For example, the following table has each letter shifted three positions to the right.
 
<div style="overflow:auto">
 
<div style="overflow:auto">
 
{| class="wikitable" style="margin-bottom: 0px"
 
{| class="wikitable" style="margin-bottom: 0px"
Line 288: Line 288:
 
From this table, it is clear that each shifted letter is the same as the original letter three spaces from it (A becomes D, B becomes E, etc). Thus, a message like "Science Olympiad is cool" would become "Vflhqfh Robpsldg lv frro" using a Caesar shift of 3. The alphabet can be shifted any number of times. This type of cryptogram can be solved through brute force, by taking a section of the message and writing out all 26 possible shifts below it, upon which the message is easily revealed.
 
From this table, it is clear that each shifted letter is the same as the original letter three spaces from it (A becomes D, B becomes E, etc). Thus, a message like "Science Olympiad is cool" would become "Vflhqfh Robpsldg lv frro" using a Caesar shift of 3. The alphabet can be shifted any number of times. This type of cryptogram can be solved through brute force, by taking a section of the message and writing out all 26 possible shifts below it, upon which the message is easily revealed.
  
====Encryption Example====
+
==== Encryption Example ====
 
Encode "example" with a shift of 7.
 
Encode "example" with a shift of 7.
  
Line 326: Line 326:
 
The encrypted text is '''lehtwsl'''.
 
The encrypted text is '''lehtwsl'''.
  
====Decryption Example====
+
==== Decryption Example ====
Decode "xhntqd".  
+
Decode "xhntqd".
  
 
We must test all possible shifts of our text to solve this prompt, since we do not know the shift. By repeatedly testing different shifts, we will eventually arrive at our answer.
 
We must test all possible shifts of our text to solve this prompt, since we do not know the shift. By repeatedly testing different shifts, we will eventually arrive at our answer.
Line 358: Line 358:
 
After shifting "xhntqd" five times, the plaintext is revealed to be '''scioly''', and no further shifts need to be tested.
 
After shifting "xhntqd" five times, the plaintext is revealed to be '''scioly''', and no further shifts need to be tested.
  
===Mono-alphabetic Substitution===
+
=== Mono-alphabetic Substitution ===
  
A mono-alphabetic substitution is one where the same plaintext letters are replaced by the same ciphertext letters. Since specific encryption/decryption methods are not mentioned in the rules, a variety of ways will be covered in the following section. Mono-alphabetic ciphers may contain spaces (Aristocrats) or may have spaces removed (Patristocrats). Mono-alphabetic ciphers may use K1, K2, or random alphabets as defined by the [http://www.cryptogram.org/ ACA].
+
A mono-alphabetic substitution is one where the same plaintext letters are replaced by the same ciphertext letters. Since specific encryption/decryption methods are not mentioned in the rules, a variety of ways will be covered in the following section. Mono-alphabetic ciphers may contain spaces (Aristocrats) or may have spaces removed (Patristocrats). Mono-alphabetic ciphers may use K1, K2, or random alphabets as defined by the [http://www.cryptogram.org/ ACA].
====Solving a mono-alphabetic substitution cipher using patterns====
+
==== Solving a mono-alphabetic substitution cipher using patterns ====
[[Image:Frequency.jpg|400px|thumb|Table of letter frequency in English.]]
+
[[File:Frequency.jpg|400px|thumb|Table of letter frequency in English.]]
 
This may be the most common way to solve a cipher on a Code Busters test, because the supervisor may not write that a Caesar cipher etc. was used to encrypt.
 
This may be the most common way to solve a cipher on a Code Busters test, because the supervisor may not write that a Caesar cipher etc. was used to encrypt.
  
 
First, find the corresponding letter for a few cipher letter by:
 
First, find the corresponding letter for a few cipher letter by:
#Look for words that are only one letter long. These will almost always be A or I, unless the cryptogram is a poem, in which case O may be used. I usually appears at the start of the sentence, while A is usually more common.
+
# Look for words that are only one letter long. These will almost always be A or I, unless the cryptogram is a poem, in which case O may be used. I usually appears at the start of the sentence, while A is usually more common.
#Look for repeated blocks of three. The block is often THE: THE is the most common english word, used almost twice as often as the second most common, BE.
+
# Look for repeated blocks of three. The block is often THE: THE is the most common english word, used almost twice as often as the second most common, BE.
#Look for frequency of letters. The 12 most frequent letters in the English alphabet are ETAOIN SHRDLU, with E being the most common by a significant margin.
+
# Look for frequency of letters. The 12 most frequent letters in the English alphabet are ETAOIN SHRDLU, with E being the most common by a significant margin.
#Look for contractions. If an apostrophe is seen in the ciphertext, it can be an easy way to start deciphering using the table below.
+
# Look for contractions. If an apostrophe is seen in the ciphertext, it can be an easy way to start deciphering using the table below.
#Look for double letters. They're often LL, followed in frequency by EE, SS, OO and TT.
+
# Look for double letters. They're often LL, followed in frequency by EE, SS, OO and TT.
  
 
Two clues may give different substitution, in which case experimenting may be helpful.
 
Two clues may give different substitution, in which case experimenting may be helpful.
Line 404: Line 404:
 
|}
 
|}
 
Common word patterns include
 
Common word patterns include
#axx- all or too
+
# axx- all or too
#xaxb- away, even, ever
+
# xaxb- away, even, ever
#xa xb- it is (at the beginning of questions, is it)
+
# xa xb- it is (at the beginning of questions, is it)
#xax... at the beginning of a word is probably eve(ry)
+
# xax... at the beginning of a word is probably eve(ry)
#...xxa at the end of a word is possibly lly
+
# ...xxa at the end of a word is possibly lly
#axbycxy- science
+
# axbycxy- science
#abxcx- there (most common) where or these
+
# abxcx- there (most common) where or these
#xabx- that (most common) high or dead
+
# xabx- that (most common) high or dead
#axbcx- which  
+
# axbcx- which
#xyaxby- people
+
# xyaxby- people
#xayybxx- success (abcddxxyxy- succeeded).
+
# xayybxx- success (abcddxxyxy- succeeded).
Keep in mind less common words may occupy these frequencies. For example xyaxby could be "indian."
+
Keep in mind less common words may occupy these frequencies. For example xyaxby could be "indian."
  
====Messages with Spaces and a Hint====
+
==== Messages with Spaces and a Hint ====
 
These cryptograms are similar to those published in 20th century newspapers. These are usually solved using patterns, as described above, with the hint providing additional information to assist the decryption.
 
These cryptograms are similar to those published in 20th century newspapers. These are usually solved using patterns, as described above, with the hint providing additional information to assist the decryption.
  
====Messages with Spaces====
+
==== Messages with Spaces ====
 
These cryptograms are similar to NSA and diplomatic messages, and '''do not have a hint'''. These are usually solved using patterns, as described above.
 
These cryptograms are similar to NSA and diplomatic messages, and '''do not have a hint'''. These are usually solved using patterns, as described above.
  
====Messages with Spaces and Spelling Errors====
+
==== Messages with Spaces and Spelling Errors ====
 
These cryptograms are similar to FBI and organized crime messages. These are often solved by patterns, with additional care:
 
These cryptograms are similar to FBI and organized crime messages. These are often solved by patterns, with additional care:
  
Line 430: Line 430:
 
* Piecing together words with word fragments may be more difficult. Misspelled words often sound the same as the actual word, which can be used to check the decrypted message.
 
* Piecing together words with word fragments may be more difficult. Misspelled words often sound the same as the actual word, which can be used to check the decrypted message.
  
====Messages without Spaces====
+
==== Messages without Spaces ====
These cryptograms are similar to NSA and espionage messages, and '''have a hint'''. An example is: "UVYNYGUSZYSBZBULAPIAZUACAZZAMLGFALPERAJZNYGUUAFBR". Students are told that the last word is TODAY, and the cipher begins with a three-letter word, followed by a four-letter word.  
+
These cryptograms are similar to NSA and espionage messages, and '''have a hint'''. An example is: "UVYNYGUSZYSBZBULAPIAZUACAZZAMLGFALPERAJZNYGUUAFBR". Students are told that the last word is TODAY, and the cipher begins with a three-letter word, followed by a four-letter word.
  
#Begin by writing in TODAY. UVYNYGUSZYSBZBULAPIAZUACAZZAMLGFALPERAJZNYGU'''TODAY'''. From this, we can see that U represents T, A represents O, F represents D, B represents A, and R represents Y.
+
# Begin by writing in TODAY. UVYNYGUSZYSBZBULAPIAZUACAZZAMLGFALPERAJZNYGU'''TODAY'''. From this, we can see that U represents T, A represents O, F represents D, B represents A, and R represents Y.
#Replace the cipher text with the decrypted letters. '''T'''VYNYG'''T'''SZYSBZ'''AT'''L'''O'''PI'''O'''Z'''TO'''C'''O'''ZZ'''O'''MLG'''DO'''LPE'''YO'''JZNYG'''TTODAY'''
+
# Replace the cipher text with the decrypted letters. '''T'''VYNYG'''T'''SZYSBZ'''AT'''L'''O'''PI'''O'''Z'''TO'''C'''O'''ZZ'''O'''MLG'''DO'''LPE'''YO'''JZNYG'''TTODAY'''
#The first word is a 3 letter word beginning with T, which we can guess decrypts to THE. Replace Vs with H and Y with E. '''THE'''N'''E'''G'''T'''SZ'''E'''S'''A'''Z'''AT'''L'''O'''PI'''O'''Z'''TO'''C'''O'''ZZ'''O'''MLG'''DO'''LPE'''YO'''JZN'''E'''G'''TTODAY'''
+
# The first word is a 3 letter word beginning with T, which we can guess decrypts to THE. Replace Vs with H and Y with E. '''THE'''N'''E'''G'''T'''SZ'''E'''S'''A'''Z'''AT'''L'''O'''PI'''O'''Z'''TO'''C'''O'''ZZ'''O'''MLG'''DO'''LPE'''YO'''JZN'''E'''G'''TTODAY'''
#In this cipher, we can see the phrase "'''TO'''C'''O'''ZZ'''O'''M". Because of the double Z in the middle, it can be inferred that this decrypts to TOMORROW. Replace Z with R, C with M, and M with W. '''THE'''N'''E'''G'''T'''S'''RE'''S'''ARAT'''L'''O'''PI'''ORTOMORROW'''LG'''DO'''LPE'''YO'''J'''R'''N'''E'''G'''TTODAY'''.
+
# In this cipher, we can see the phrase "'''TO'''C'''O'''ZZ'''O'''M". Because of the double Z in the middle, it can be inferred that this decrypts to TOMORROW. Replace Z with R, C with M, and M with W. '''THE'''N'''E'''G'''T'''S'''RE'''S'''ARAT'''L'''O'''PI'''ORTOMORROW'''LG'''DO'''LPE'''YO'''J'''R'''N'''E'''G'''TTODAY'''.
#We can see the letters '''YO'''J'''R'''. This is probably YOUR. Replace J with U. '''THE'''N'''E'''G'''T'''S'''RE'''S'''ARAT'''L'''O'''PI'''ORTOMORROW'''LG'''DO'''LPE'''YOUR'''N'''E'''G'''TTODAY'''.
+
# We can see the letters '''YO'''J'''R'''. This is probably YOUR. Replace J with U. '''THE'''N'''E'''G'''T'''S'''RE'''S'''ARAT'''L'''O'''PI'''ORTOMORROW'''LG'''DO'''LPE'''YOUR'''N'''E'''G'''TTODAY'''.
#The letters LG after the noun TOMORROW likely decrypt to IS. Replace L with I and G with S. '''THE'''N'''EST'''S'''RE'''S'''ARATIO'''PI'''ORTOMORROWISDOI'''PE'''YOUR'''N'''ESTTODAY'''.
+
# The letters LG after the noun TOMORROW likely decrypt to IS. Replace L with I and G with S. '''THE'''N'''EST'''S'''RE'''S'''ARATIO'''PI'''ORTOMORROWISDOI'''PE'''YOUR'''N'''ESTTODAY'''.
#N'''EST''' probably decrypts to B, as that is the only word that makes sense in this context. '''THEBEST'''S'''RE'''S'''ARATIO'''PI'''ORTOMORROWISDOI'''PE'''YOURBESTTODAY'''.
+
# N'''EST''' probably decrypts to B, as that is the only word that makes sense in this context. '''THEBEST'''S'''RE'''S'''ARATIO'''PI'''ORTOMORROWISDOI'''PE'''YOURBESTTODAY'''.
#At this point, the cipher is able to be solved using common sense. S'''RE'''S'''ARATIO'''P likely means PREPARATION. I'''OR''' probably means FOR. DOI'''PE''' probably means DOING. Thus, the message is THE BEST PREPARATION FOR TOMORROW IS DOING YOUR BEST TODAY.
+
# At this point, the cipher is able to be solved using common sense. S'''RE'''S'''ARATIO'''P likely means PREPARATION. I'''OR''' probably means FOR. DOI'''PE''' probably means DOING. Thus, the message is THE BEST PREPARATION FOR TOMORROW IS DOING YOUR BEST TODAY.
  
====Messages without Spaces or Hints====
+
==== Messages without Spaces or Hints ====
 
These cryptograms are extremely difficult and may not be tested very frequently. In the event that a test does contain one, the best method is using the patterns listed above, especially finding repeated three letter "phrases" or double letters.
 
These cryptograms are extremely difficult and may not be tested very frequently. In the event that a test does contain one, the best method is using the patterns listed above, especially finding repeated three letter "phrases" or double letters.
  
===Affine Cipher and Modular Arithmetic===
+
=== Affine Cipher and Modular Arithmetic ===
  
 
The Affine cipher uses an alphabet of size [math]m[/math] with keys [math]a[/math] and [math]b[/math] such that [math]a,b[/math] are integers, and [math]a[/math] and [math]m[/math] are coprime (there is no positive divisor for both of them besides 1). Assuming the alphabet is of size 26, [math]a[/math] can be 1, 3, 5, 7, 9, 11 ,15, 17, 19, 21, 23 and 25. Each letter in the alphabet corresponds to a number from [math]0[/math] to [math]m-1[/math]. The most common correspondence for the English alphabet is shown below.
 
The Affine cipher uses an alphabet of size [math]m[/math] with keys [math]a[/math] and [math]b[/math] such that [math]a,b[/math] are integers, and [math]a[/math] and [math]m[/math] are coprime (there is no positive divisor for both of them besides 1). Assuming the alphabet is of size 26, [math]a[/math] can be 1, 3, 5, 7, 9, 11 ,15, 17, 19, 21, 23 and 25. Each letter in the alphabet corresponds to a number from [math]0[/math] to [math]m-1[/math]. The most common correspondence for the English alphabet is shown below.
Line 516: Line 516:
 
</div>
 
</div>
  
In the formula, [math]x[/math] is the corresponding number of plaintext. For example, if encrypting N, [math]x[/math] would be 13. Essentially, numbers are plugged into the formula and the resulting number corresponds to the encrypted letter.
+
In the formula, [math]x[/math] is the corresponding number of plaintext. For example, if encrypting N, [math]x[/math] would be 13. Essentially, numbers are plugged into the formula and the resulting number corresponds to the encrypted letter.
  
 
For this example, we encode the message CODEBUSTERS using [math]a=9[/math] and [math]b=42[/math]. To slightly speed up the process, use the fact from modular arithmetic that the function [math]ax+b[/math] does not change if we also take [math]a, b[/math] modulo 26: the function [math]9x+42[/math] is equivalent to the function [math]9x+16[/math] or [math]9x-10[/math].
 
For this example, we encode the message CODEBUSTERS using [math]a=9[/math] and [math]b=42[/math]. To slightly speed up the process, use the fact from modular arithmetic that the function [math]ax+b[/math] does not change if we also take [math]a, b[/math] modulo 26: the function [math]9x+42[/math] is equivalent to the function [math]9x+16[/math] or [math]9x-10[/math].
Line 598: Line 598:
 
</div>
 
</div>
  
In this case, [math]a^{-1}[/math] is the multiplicative inverse of [math]a[/math] modulo [math]m[/math] ([math]aa^{-1}\bmod m=1[/math]). Because there are only 26 values, one can brute force it to find the value of [math]t[/math] where [math]ta \bmod m=1[/math]. [math]t[/math] represents [math]a^{-1}[/math].  
+
In this case, [math]a^{-1}[/math] is the multiplicative inverse of [math]a[/math] modulo [math]m[/math] ([math]aa^{-1}\bmod m=1[/math]). Because there are only 26 values, one can brute force it to find the value of [math]t[/math] where [math]ta \bmod m=1[/math]. [math]t[/math] represents [math]a^{-1}[/math].
  
 
<div align="center" style="overflow:auto">
 
<div align="center" style="overflow:auto">
Line 773: Line 773:
 
</div>
 
</div>
  
Sometimes, some characters are given, which makes decryption much easier. For example, one might be given the ciphertext "CXWZ ZRC OWGW" and told that the first word is "EDIT". Thus, the characters are mapped as:  
+
Sometimes, some characters are given, which makes decryption much easier. For example, one might be given the ciphertext "CXWZ ZRC OWGW" and told that the first word is "EDIT". Thus, the characters are mapped as:
 
<div align="center">
 
<div align="center">
 
{|class="wikitable"
 
{|class="wikitable"
Line 802: Line 802:
 
</div>
 
</div>
  
Cancel out the [math]a[/math] by multiplying to get the same value (same process as solving a system of equations).  
+
Cancel out the [math]a[/math] by multiplying to get the same value (same process as solving a system of equations).
  
 
<div align="center">
 
<div align="center">
Line 866: Line 866:
  
  
===Vigenère Cipher===
+
=== Vigenère Cipher ===
  
The Vigenère cipher, invented by Blaise de Vigenère in the 16th century, is a polyalphabetic cipher (this means that it is a substitution cipher but uses multiple substitution alphabets, so if A decrypts to B at some point, it does not necessarily mean that all of the A's will decrypt to B). This means that each letter is shifted by a different amount. According to the rules, students will probably be asked to encrypt rather than decrypt Vigenère ciphers. Encrypting is a fairly straightforward procedure.  
+
The Vigenère cipher, invented by Blaise de Vigenère in the 16th century, is a polyalphabetic cipher (this means that it is a substitution cipher but uses multiple substitution alphabets, so if A decrypts to B at some point, it does not necessarily mean that all of the A's will decrypt to B). This means that each letter is shifted by a different amount. According to the rules, students will probably be asked to encrypt rather than decrypt Vigenère ciphers. Encrypting is a fairly straightforward procedure.
  
====Encryption/Decryption With a Table====
+
==== Encryption/Decryption With a Table ====
First, write out the message with the key under it, repeating the key as many times as necessary. An example is shown.  
+
First, write out the message with the key under it, repeating the key as many times as necessary. An example is shown.
  
 
<div align="center">
 
<div align="center">
Line 925: Line 925:
 
|}
 
|}
 
</div>
 
</div>
Then, take out the alphabet square, as shown below. This will typically be provided on the test.  
+
Then, take out the alphabet square, as shown below. This will typically be provided on the test.
  
 
[[File:vig_table.png|thumb|500px|center|Vigenère Alphabet Table]]
 
[[File:vig_table.png|thumb|500px|center|Vigenère Alphabet Table]]
Line 933: Line 933:
 
If the key and ciphertext are both given, decoding is also possible. This is done by taking a letter of the '''key''' and finding its '''row''', finding the corresponding letter of '''ciphertext''' in that row, and seeing what column that letter falls in. The letter in the column is the letter of the plaintext. In the previous example, the first letter is decoded by going to row S and finding K, which is located in column S. Thus, the plaintext letter is S.
 
If the key and ciphertext are both given, decoding is also possible. This is done by taking a letter of the '''key''' and finding its '''row''', finding the corresponding letter of '''ciphertext''' in that row, and seeing what column that letter falls in. The letter in the column is the letter of the plaintext. In the previous example, the first letter is decoded by going to row S and finding K, which is located in column S. Thus, the plaintext letter is S.
  
====Encryption/Decryption Without a Table====
+
==== Encryption/Decryption Without a Table ====
 
Tables are typically given on the test, but in the event they are not, the following strategy may be more helpful.
 
Tables are typically given on the test, but in the event they are not, the following strategy may be more helpful.
  
Line 940: Line 940:
 
For example, if we encode the message "SCIENCEOLYMPIADISCOOL" using the key SCIOLY, we get
 
For example, if we encode the message "SCIENCEOLYMPIADISCOOL" using the key SCIOLY, we get
  
[[Image:VigenereExample.png|500px|center]]
+
[[File:VigenereExample.png|500px|center]]
  
 
To decode a message using this method, subtract instead of add the key's corresponding number: The cipher text K with the corresponding key letter S gives plain text [math]10-18=-8\equiv18\pmod{26}\to \text{S}[/math].
 
To decode a message using this method, subtract instead of add the key's corresponding number: The cipher text K with the corresponding key letter S gives plain text [math]10-18=-8\equiv18\pmod{26}\to \text{S}[/math].
  
===Baconian Cipher===
+
=== Baconian Cipher ===
The Baconian cipher replaces each letter of the plaintext with a 5 letter combination of 'A' and 'B'. This replacement is a binary form of encoding, in which 'A' may be considered as 0 and 'B' as 1. One variant of the Baconian Cipher uses a 24 letter alphabet with the letters 'I' and 'J' having the same code, as well as 'U' and 'V'.  
+
The Baconian cipher replaces each letter of the plaintext with a 5 letter combination of 'A' and 'B'. This replacement is a binary form of encoding, in which 'A' may be considered as 0 and 'B' as 1. One variant of the Baconian Cipher uses a 24 letter alphabet with the letters 'I' and 'J' having the same code, as well as 'U' and 'V'.
 
<div style="overflow:auto">
 
<div style="overflow:auto">
 
{| class="wikitable" style="margin-bottom: 0px"
 
{| class="wikitable" style="margin-bottom: 0px"
Line 1,131: Line 1,131:
 
When solving a question encoded with the Baconian Cipher, it is very likely that they won't explicitly give you "A" and "B" to use to find the corresponding letters. Most of the time, they'll have certain symbols or letters that are meant to represent "A" and "B". One example of this would be using all of of the even letters in the alphabet to represent "A" while all the odd letters represent "B". There are many different variants of this, including symbols on a keyboard and vowel/consonants. To solve a Baconian, try to group the different symbols/letters into two groups based on their properties, and assign one group "A" and the other group "B". If it doesn't work the first time, then switch the groups so that the previous "A" group is now the "B" group. If even then it doesn't seem to be working, then start over again and find a different characteristic to base the groups off of. For this reason, the Baconian Cipher can take longer than some of the other ciphers.
 
When solving a question encoded with the Baconian Cipher, it is very likely that they won't explicitly give you "A" and "B" to use to find the corresponding letters. Most of the time, they'll have certain symbols or letters that are meant to represent "A" and "B". One example of this would be using all of of the even letters in the alphabet to represent "A" while all the odd letters represent "B". There are many different variants of this, including symbols on a keyboard and vowel/consonants. To solve a Baconian, try to group the different symbols/letters into two groups based on their properties, and assign one group "A" and the other group "B". If it doesn't work the first time, then switch the groups so that the previous "A" group is now the "B" group. If even then it doesn't seem to be working, then start over again and find a different characteristic to base the groups off of. For this reason, the Baconian Cipher can take longer than some of the other ciphers.
  
===Xenocrypt===
+
=== Xenocrypt ===
At the invitational/Regional level, '''one''' cryptogram may be in Spanish as a challenge. At the state level, there will be '''at least one'''. It may be helpful if one of the partners is fluent in or has a few years of knowledge in Spanish.  
+
At the invitational/Regional level, '''one''' cryptogram may be in Spanish as a challenge. At the state level, there will be '''at least one'''. It may be helpful if one of the partners is fluent in or has a few years of knowledge in Spanish.
  
 
For Spanish cryptograms, n and ñ are treated as different letters. However, letters with accents are treated the same as without (a and á are the same). This means that, when working with cryptograms, accent marks do not factor in. Also, ch, ll, and rr are NOT considered distinct letters. Thus, "churro" would have 6 letters: c-h-u-r-r-o. The Spanish alphabet used for cryptograms is as follows:
 
For Spanish cryptograms, n and ñ are treated as different letters. However, letters with accents are treated the same as without (a and á are the same). This means that, when working with cryptograms, accent marks do not factor in. Also, ch, ll, and rr are NOT considered distinct letters. Thus, "churro" would have 6 letters: c-h-u-r-r-o. The Spanish alphabet used for cryptograms is as follows:
Line 1,245: Line 1,245:
 
* Decrypting words using word fragments are much more difficult for teams without fluency in Spanish.
 
* Decrypting words using word fragments are much more difficult for teams without fluency in Spanish.
  
===Hill Cipher===
+
=== Hill Cipher ===
  
 
'''''NOTE:''' These cryptograms will be matrix based, and only use 2x2 or 3x3 matrices.''
 
'''''NOTE:''' These cryptograms will be matrix based, and only use 2x2 or 3x3 matrices.''
  
The alphabet for the Hill cipher has corresponding numbers as follows:
+
The alphabet for the Hill cipher has corresponding numbers as follows:
  
 
<div align="center" style="overflow:auto">
 
<div align="center" style="overflow:auto">
Line 1,313: Line 1,313:
 
|}
 
|}
 
</div>
 
</div>
Begin by picking a key matrix of either 2x2 or 3x3. These could be a 4 letter word or three 3 letter words. For this example, the key will be WIKI (2x2 matrix). Then, break the message into groups of two. This example will use the message SCIENCE OLYMPIAD, which would be split up into SC IE NC EO LY MP IA D'''Z'''. Notice that a '''Z''' is added in order to make the last group a group of two. Write the message and the key as matrices.  
+
Begin by picking a key matrix of either 2x2 or 3x3. These could be a 4 letter word or three 3 letter words. For this example, the key will be WIKI (2x2 matrix). Then, break the message into groups of two. This example will use the message SCIENCE OLYMPIAD, which would be split up into SC IE NC EO LY MP IA D'''Z'''. Notice that a '''Z''' is added in order to make the last group a group of two. Write the message and the key as matrices.
  
 
<div align="center">
 
<div align="center">
Line 1,341: Line 1,341:
 
</div>
 
</div>
  
In the second step of the above equation, the matrices are multiplied. Although it may seem complicated, matrix multiplication is fairly straightforward.  
+
In the second step of the above equation, the matrices are multiplied. Although it may seem complicated, matrix multiplication is fairly straightforward.
 
<div align="center">
 
<div align="center">
 
[math]\begin{pmatrix}
 
[math]\begin{pmatrix}
Line 1,360: Line 1,360:
 
</div>
 
</div>
  
Matrix multiplication for 3x3 matrices is very similar.  
+
Matrix multiplication for 3x3 matrices is very similar.
 
<div align="center">
 
<div align="center">
 
[math]\begin{pmatrix}
 
[math]\begin{pmatrix}
Line 1,381: Line 1,381:
 
\end{pmatrix}[/math]
 
\end{pmatrix}[/math]
 
</div>
 
</div>
It is important to note that in order to multiply matrices, the number of columns in the first matrix MUST equal the number of rows in the second matrix. The size of the product matrix is the number of rows in the first matrix x the number of columns in the second matrix.  
+
It is important to note that in order to multiply matrices, the number of columns in the first matrix MUST equal the number of rows in the second matrix. The size of the product matrix is the number of rows in the first matrix x the number of columns in the second matrix.
  
 
The "mod" operation is also fairly straightforward. Essentially, it finds the remainder after dividing. For example, [math]153 \bmod 26 [/math] is equal to the remainder of [math]153 / 26[/math], which is 23. On a scientific calculator, this is found by dividing the two numbers, subtracting the integer value from the answer, and multiplying the decimals by the number after "mod" (in this case, 26). Therefore, the process would be:
 
The "mod" operation is also fairly straightforward. Essentially, it finds the remainder after dividing. For example, [math]153 \bmod 26 [/math] is equal to the remainder of [math]153 / 26[/math], which is 23. On a scientific calculator, this is found by dividing the two numbers, subtracting the integer value from the answer, and multiplying the decimals by the number after "mod" (in this case, 26). Therefore, the process would be:
Line 1,601: Line 1,601:
 
The encoded message is WOAIQQSWSQUGUCSW.
 
The encoded message is WOAIQQSWSQUGUCSW.
  
3x3 matrix encryption works in the same way. This example will encrypt "EDIT THE WIKI" using the key "BEE FLY BUG". First, split up the plaintext into groups of three, which becomes EDI TTH EWI KIZ. Once again, the last group has a Z added to make it a group of three.  
+
3x3 matrix encryption works in the same way. This example will encrypt "EDIT THE WIKI" using the key "BEE FLY BUG". First, split up the plaintext into groups of three, which becomes EDI TTH EWI KIZ. Once again, the last group has a Z added to make it a group of three.
  
 
<div align="center">
 
<div align="center">
Line 1,757: Line 1,757:
 
Repeat for other values
 
Repeat for other values
  
===Morse Ciphers===
+
=== Morse Ciphers ===
 
The Morse ciphers are a pair of ciphers where you are given a long text of numbers, where each number corresponds to one or two Morse characters (dot, dash, or a separator). Some of these number values will be given while some will not. Using the properties of Morse code and logical thinking, you must find the decryption for all of the missing numbers.
 
The Morse ciphers are a pair of ciphers where you are given a long text of numbers, where each number corresponds to one or two Morse characters (dot, dash, or a separator). Some of these number values will be given while some will not. Using the properties of Morse code and logical thinking, you must find the decryption for all of the missing numbers.
  
 
The dot and dash are self-explanatory. Separators, however, have two use cases:
 
The dot and dash are self-explanatory. Separators, however, have two use cases:
#Letter separator: In this case, there will be one separator character (like an X) which separates two letters.
+
# Letter separator: In this case, there will be one separator character (like an X) which separates two letters.
#Word separator: In this case, there will be two separator characters which separate two words.
+
# Word separator: In this case, there will be two separator characters which separate two words.
  
 
There can never be more than two separator characters in a row. This is very useful when solving because it allows you to eliminate the possibility of a number next to two separators being another separator.
 
There can never be more than two separator characters in a row. This is very useful when solving because it allows you to eliminate the possibility of a number next to two separators being another separator.
  
====Pollux Cipher====
+
==== Pollux Cipher ====
In a pollux cipher, each number corresponds to one Morse character.
+
In a pollux cipher, each number corresponds to one Morse character. In a pollux cipher (and only in a pollux cipher), the quote cannot end with a separator.
  
 
An example question is given below.
 
An example question is given below.
Line 1,795: Line 1,795:
 
</div>
 
</div>
  
This is where you have to make a decision. If you chose to try finding out what the number 6 is, you could do the same process as we did for the number 4 using the four pieces separated by X's that only have a 6 in them (these are "6•••", "6-••", and "•6•"). However, you could also try to find out what the number 8 is. Since you do not have multiple pieces with only an 8 in them, this would be slightly more difficult.  
+
This is where you have to make a decision. If you chose to try finding out what the number 6 is, you could do the same process as we did for the number 4 using the four pieces separated by X's that only have a 6 in them (these are "6•••", "6-••", and "•6•"). However, you could also try to find out what the number 8 is. Since you do not have multiple pieces with only an 8 in them, this would be slightly more difficult.
  
 
Let's assume you went with finding out what the number 6 is. Here, you can make a very keen observation if you were to look at the piece "6•••". The Morse alphabet only has one letter that ends with three dots: the letter H! Since H starts with a dot, you now know that 6 is also a dot.
 
Let's assume you went with finding out what the number 6 is. Here, you can make a very keen observation if you were to look at the piece "6•••". The Morse alphabet only has one letter that ends with three dots: the letter H! Since H starts with a dot, you now know that 6 is also a dot.
Line 1,813: Line 1,813:
 
Luck helps! Don't forget to ignore the X's that are separators, or you will end up with a very strange piece of text. For this reason, you may want to use another character, like / or | instead of an X to avoid confusion.
 
Luck helps! Don't forget to ignore the X's that are separators, or you will end up with a very strange piece of text. For this reason, you may want to use another character, like / or | instead of an X to avoid confusion.
  
====Morbit Cipher====
+
==== Morbit Cipher ====
In a morbit cipher, each number corresponds to two Morse characters. Each pair of Morse character can only correspond to one number, meaning there are only nine possible decryptions.
+
In a morbit cipher, each number corresponds to two Morse characters. Each pair of Morse character can only correspond to one number, meaning there are only nine possible decryptions. Whereas pollux quotes cannot end with a separator, morbit ciphers may or may not end with a separator. This is because each number has to correspond to two Morse characters, so an extra separator is added at the end if the quote in Morse code is an odd number of characters.
  
===Running Key Cipher===
+
An example question is given below.
The running key cipher is a variant of the Vigenère Cipher. Rather than using a word as a key, a sentence/paragraph is used as the key. Essentially, instead of repeating a word multiple times as the key, a sentence/paragraph constitutes as the key and is used continuously. If the test was made with [https://toebes.com/codebusters Toebes], then the four standard documents used to create a question using the Running Key Cipher are:  
+
 
 +
Decode this quote which has been encoded using a Pollux Cipher, where 5 = •-, 7 = -x, 1 = x•, 4 = -•, 8 = •x, and 2 = --.
 +
<div style="text-align: center;">
 +
27435881512827465679378
 +
</div>
 +
 
 +
We first begin by substituting what we already know. This should always be the first thing you do when you see a Morse cipher!
 +
<div style="text-align: center;">
 +
--- X -•3•-• X • XX ••- X •--• X --- X -•6•-6- X 93- X • X
 +
</div>
 +
 
 +
Here, we can see what was mentioned above. Since the quote has an odd number of Morse characters, it ends with an X (separator) to make sure the last number corresponds to two Morse characters. Now, we can begin translating the Morse pieces we know completely into letters!
 +
<div style="text-align: center;">
 +
O X -•3•-• X E XX U X P X O X -•6•-6- X 93- X E X
 +
</div>
 +
 
 +
It is important to remember here that X's are separators and not part of the quote. This quote does not contain any X's, but it is recommended that you use a different separator on an actual test so that you do not get confused if the quote does contain an X.
 +
 
 +
Here, we can apply a very important piece of knowledge about Morse code: No letter translates to more than four Morse characters (dots and dashes). Near the beginning, we see there is a piece that reads "X -•3•-• X". On the left of the number 3, we see two Morse characters, and on the right we see three. If the decryption of the number 3 did not contain an X, then this piece would be illegal because it would contain 2 + 2 + 3 = 7 Morse characters in a row!
 +
 
 +
To figure out what the number 3 decrypts to, we can try substituting "X_" (separator followed by a blank that could be a dot or a dash) and "_X" (the first option but backwards). First trying "X_", we have "X -• X _•-• X". This translates to "N _", where the blank is another letter. This letter should look like "_•-•" in Morse. Using our knowledge of the Morse alphabet, we know that the two letters that match this pattern are "••-•" (F) and "-•-•" (C). "NF" and "NC" are both reasonable, but we already know most of the first word, "O_E" (taking the two letters from the ciphertext above). This means it could either be "ONFE" or "ONCE", and it is clearly the latter. This means that the number 3 is probably "X-"! Although we didn't try the possibility of the number 3 being "_X", you can try this yourself using the same strategy used above to see that it is probably not correct.
 +
 
 +
Now, we can substitute the number 3 in!
 +
<div style="text-align: center;">
 +
O X -• X -•-• X E XX U X P X O X -•6•-6- X 9 X -- X E X
 +
</div>
 +
 
 +
Translating the new Morse pieces we know, we find out a few more letters.
 +
<div style="text-align: center;">
 +
O X N X C X E XX U X P X O X -•6•-6- X 9 X M X E X
 +
</div>
 +
 
 +
If you spent just 30 seconds staring at this, you might be able to guess what the remaining letters are without even working the Morse out! Let's continue with the Morse anyways.
 +
 
 +
At this point, we have two numbers left, 6 and 9. If we were to look at the number 6, we can apply the same logic as we did with the number 3 using the fact that Morse letters are no longer than 4 characters. For sake of example, however, let's take a look at the number 9. We see that it is a single number surrounded by X's, meaning it cannot contain an X. Although you may think this does not cut down the possibilities very much, recall a key fact about the morbit decryptions: each Morse code pair (like ••, •-, •x, etc.) can only correspond to one number. Let's make a table of which numbers and pairs we have so far!
 +
 
 +
<div style="text-align: center;">
 +
{| class="wikitable"
 +
|-
 +
| 1 || 2 || 3 || 4 || 5 || 6 || 7 || 8 || 9
 +
|-
 +
| x• || -- || x- || -• || •- || ? || -x || •x || ?
 +
|}
 +
</div>
 +
 
 +
The only Morse code pairs we are missing are "XX" and "••". However, we already established that the number 9 cannot contain an X, meaning it has to be "••". By process of elimination this means that the number 6 has to be "XX"!
 +
 
 +
We now have all the numbers figured out and can substitute the remaining ones in for their Morse decryption.
 +
<div style="text-align: center;">
 +
O X N X C X E XX U X P X O X -• XX •- XX - X •• X M X E X
 +
</div>
 +
 
 +
Translating Morse to the alphabet and removing the separators, we have
 +
<div style="text-align: center;">
 +
ONCE UPON A TIME
 +
</div>
 +
 
 +
This example is slightly unrealistic since obvious clues were ignored and the quote is quite short. However, all principles of solving a morbit cipher have been shown so you can use them in any morbit cipher you see, regardless of difficulty!
 +
 
 +
=== Running Key Cipher ===
 +
The running key cipher is a variant of the Vigenère Cipher. Rather than using a word as a key, a sentence/paragraph is used as the key. Essentially, instead of repeating a word multiple times as the key, a sentence/paragraph constitutes as the key and is used continuously. If the test was made with [https://toebes.com/codebusters Toebes], then the four standard documents used to create a question using the Running Key Cipher are:
  
 
* The first line of the Gettysburg Address
 
* The first line of the Gettysburg Address
Line 1,824: Line 1,884:
 
* The first line of the Magna Carta (in Latin)
 
* The first line of the Magna Carta (in Latin)
  
In the event that a question encoded with the running key cipher asks you to decode the phrase but does not give the key for it, then one has to use one of the documents given on the reference sheet (if applicable) and plug them all in to determine which of the documents is the key. If they give the key but do not give the text of the key (ex. "a famous quote by George Washington"), then it is probably best to skip the question.  
+
In the event that a question encoded with the running key cipher asks you to decode the phrase but does not give the key for it, then one has to use one of the documents given on the reference sheet (if applicable) and plug them all in to determine which of the documents is the key. If they give the key but do not give the text of the key (ex. "a famous quote by George Washington"), then it is probably best to skip the question.
  
===RSA Cipher===
+
=== RSA Cipher ===
 
Choose two primes [math]p[/math] and [math]q[/math].
 
Choose two primes [math]p[/math] and [math]q[/math].
  
Line 1,837: Line 1,897:
 
Compute the inverse [math]d[/math] of [math]e[/math] modulo [math]\lambda(n)[/math].
 
Compute the inverse [math]d[/math] of [math]e[/math] modulo [math]\lambda(n)[/math].
  
Now, say that Alice wants to receive from Bob a message. Alice sends Bob her public key (n, e) through a reliable channel.
+
Now, say that Alice wants to receive from Bob a message. Alice sends Bob her public key (n, e) through a reliable channel.
 
Bob translates his message M to an integer m, and then converts it to ciphertext using [math]c \equiv m^e mod n[/math].
 
Bob translates his message M to an integer m, and then converts it to ciphertext using [math]c \equiv m^e mod n[/math].
  
Line 1,843: Line 1,903:
  
  
===Sir Arthur Conan Doyle's Cipher from ''The Adventure of the Dancing Men''===
+
=== Sir Arthur Conan Doyle's Cipher from ''The Adventure of the Dancing Men'' ===
While not explicitly stated in the rules, the Dancing Men cipher has appeared in previous tests and possibly may appear as a bonus question in future tests. The Dancing Men cipher is a monoalphabetic substitution cipher with spaces where each letter is represented by a dancing man. A man holding a flag indicates the end of a word. In the story, messages encrypted with this cipher were sent to a woman named Elsie, Sherlock Holmes solved the cipher using that E is the most common letter, and that Elsie's name would likely appear. Since the cipher may be easily decrypted if all the dancing men are memorized, there are a few patterns to help remember them. O and A, R and I, and T and E are flipped. T and E are symmetrical about a vertical axis. N and S have the same legs and right arm. The substitution chart is found below.  
+
While not explicitly stated in the rules, the Dancing Men cipher has appeared in previous tests and possibly may appear as a bonus question in future tests. The Dancing Men cipher is a monoalphabetic substitution cipher with spaces where each letter is represented by a dancing man. A man holding a flag indicates the end of a word. In the story, messages encrypted with this cipher were sent to a woman named Elsie, Sherlock Holmes solved the cipher using that E is the most common letter, and that Elsie's name would likely appear. Since the cipher may be easily decrypted if all the dancing men are memorized, there are a few patterns to help remember them. O and A, R and I, and T and E are flipped. T and E are symmetrical about a vertical axis. N and S have the same legs and right arm. The substitution chart is found below.
  
[[Image:DancingMenCipher.png|thumb|center|500px|Dancing Men Cipher]]
+
[[File:DancingMenCipher.png|thumb|center|500px|Dancing Men Cipher]]
An example of the Dancing Men cipher is listed below.  
+
An example of the Dancing Men cipher is listed below.
  
[[Image:DancingMenCipherExample.png|300px]] contains the message "NOTARIES", which conveniently shows the patterns listed above.
+
[[File:DancingMenCipherExample.png|300px]] contains the message "NOTARIES", which conveniently shows the patterns listed above.
  
 
Note: The Dancing Men cipher is not included in 2019 rules. However, it is a common part of tests from past years' trial events.
 
Note: The Dancing Men cipher is not included in 2019 rules. However, it is a common part of tests from past years' trial events.
  
==External Links==
+
== External Links ==
 
:Trial event rules
 
:Trial event rules
 
::[https://www.soinc.org/sites/default/files/uploaded_files/Code%20Busters%202016.pdf 2016 Nationals]
 
::[https://www.soinc.org/sites/default/files/uploaded_files/Code%20Busters%202016.pdf 2016 Nationals]
Line 1,884: Line 1,944:
 
::[http://toebes.com/Ciphers/Samples/Code%20Busters%202018%20Sample%2010%20Answers.pdf Practice Test 10 KEY]
 
::[http://toebes.com/Ciphers/Samples/Code%20Busters%202018%20Sample%2010%20Answers.pdf Practice Test 10 KEY]
  
Past tests can also be found [http://toebes.com/Ciphers/index.html here].  
+
Past tests can also be found [http://toebes.com/Ciphers/index.html here].
 
{{SpoilerBoxEnd}}
 
{{SpoilerBoxEnd}}
  
Line 1,894: Line 1,954:
 
{{Inquiry Event}}
 
{{Inquiry Event}}
 
{{2021Events}}
 
{{2021Events}}
 +
 
[[Category:Inquiry and Nature of Science Events]]
 
[[Category:Inquiry and Nature of Science Events]]
[[Category: Event Pages]]
+
[[Category:Event Pages]]
[[Category: Lab Event Pages]]
+
[[Category:Lab Event Pages]]
 
[[Category:Trial Event Pages]]
 
[[Category:Trial Event Pages]]

Latest revision as of 21:23, 4 March 2021

This page contains a large number of equations and mathematical symbols, which may take some time to load.

Codebusters is an event in Division C for the 2020 season and was held as trial event at both the 2016 National Tournament and the 2018 National Tournament. It was last held as an official event in 2019. It is also being held as a trial event for Division B at the 2020 National Tournament. In this event, up to 3 participants must decode encrypted messages, or they may be required to encode messages with certain advanced ciphers. Competitors are not allowed to bring any resources to this event, but can bring a 4 or 5 function calculator - no scientific or graphing calculators allowed.

Test Format

Format and Scoring

Tests are composed of a variety of questions where teams will encrypt or decrypt various code types. The number of questions on a given test is variable, but tests often contain anywhere from 6-24 questions, depending on the difficulty of the questions. The first question of a test is timed, and a time bonus is given for the question based on how quickly it is completed. Points may be deducted from questions based on the number of mistakes found in the answer given. If the answer differs from the solution by only one or two letters, then no points are removed, despite the answer having errors. Each additional error after two errors will result in a deduction of 100 points. The number of points removed from a question through deductions will not exceed the value of the question (meaning that deductions will never result in a question score below 0).

The First Question

The very first question is timed - when solved, a team member should signal the event supervisor that they have finished the question, such as raising their hand, shouting "bingo!", or another method determined by the supervisor before the event begins. The first question will be an Aristocrat with or without a hint. Teams will receive bonus points depending on their time, and they may make as many attempts as they want to break the code without any penalties. The timing bonus will be calculated from the start of the event until the question is answered successfully, or until 10 minutes have elapsed, and is calculated with the formula: 4*(600-number of seconds taken). Teams may still answer the question after 10 minutes; however, the timing bonus is 0. The first cryptogram may also be used as a tiebreaker. Solutions are given full points only if the solution is an exact match or differs by only one or two letters. Deductions for inconsistencies in the answer to the first question are treated the same as deductions for a non-timed question.

Question Point Distribution

The amount of points each question is worth will be distributed by the following:

  • An easy question: 100-150 points
  • A medium question: 200-300 points
  • A hard question: 350-500 points
  • A very hard question: 550-700 points

In the case of a tie, select questions predetermined by the event supervisor will serve as a tiebreaker. The tie is broken using the following criteria in this order: score, degree of correctness, and number attempted.

Code types that may be used at the Invitational and Regional Competitions

given the mapping of at least 6 of the digits

Code types that may be used at the State and National Competitions

Code Types

Atbash Cipher

The Atbash Cipher is a variant of the affine cipher (see above) in which both a and b equal 25. This results in the alphabet essentially becoming a mirror (A corresponds to Z, B corresponds to Y, C corresponds to X, etc.).

Atbash Cipher
Original Alphabet 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
Ciphertext Alphabet Z Y X W V U T S R Q P O N M L K J I H G F E D C B A

Following the affine cipher, the encryption formula would be:

[math]E(x) = (25x + 25) \mod 26[/math]

However, observing the mirror like alphabet yields a much simpler equation of:

[math]E(x) = D(x) = 25 - x[/math]

Since the alphabet is like a mirror, encryption is the same as decryption.


Encryption Example

Encode "encrypt" with the Atbash Cipher.

Plaintext E N C R Y P T
Numeric Component 4 13 2 17 24 15 19
[math]25 - x[/math] 21 12 23 8 1 10 6
Ciphertext V M X I B K G

The cipher text is "vmxibkg."

Decryption Example

Decode "zmhdvi" with the Atbash Cipher.

Plaintext Z M H D V I
Numeric Component 25 12 7 3 21 8
[math]25 - x[/math] 0 13 18 22 4 17
Ciphertext A N S W E R

The plaintext is "answer."

Caesar Cipher

One example of a mono-alphabetic substitution is Caesar shift cipher, where each letter is replaced by one shifted by a certain amount. For example, the following table has each letter shifted three positions to the right.

Caesar Shift Example Table
Original Alphabet 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
Shifted Alphabet (to the right 3) 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

From this table, it is clear that each shifted letter is the same as the original letter three spaces from it (A becomes D, B becomes E, etc). Thus, a message like "Science Olympiad is cool" would become "Vflhqfh Robpsldg lv frro" using a Caesar shift of 3. The alphabet can be shifted any number of times. This type of cryptogram can be solved through brute force, by taking a section of the message and writing out all 26 possible shifts below it, upon which the message is easily revealed.

Encryption Example

Encode "example" with a shift of 7.

By shifting each letter 7 times, we can encrypt the text.

Example Encoding
Encryption Shift Possible Plaintext
0 example
1 fybnqmf
2 gzcorng
3 hadpsoh
4 ibeqtpi
5 jcfruqj
6 kdgsvrk
7 lehtwsl

The encrypted text is lehtwsl.

Decryption Example

Decode "xhntqd".

We must test all possible shifts of our text to solve this prompt, since we do not know the shift. By repeatedly testing different shifts, we will eventually arrive at our answer.

Example Decoding
Decryption Shift Possible Plaintext
0 xhntqd
1 wgmspc
2 vflrob
3 uekqna
4 tdjpmz
5 scioly

After shifting "xhntqd" five times, the plaintext is revealed to be scioly, and no further shifts need to be tested.

Mono-alphabetic Substitution

A mono-alphabetic substitution is one where the same plaintext letters are replaced by the same ciphertext letters. Since specific encryption/decryption methods are not mentioned in the rules, a variety of ways will be covered in the following section. Mono-alphabetic ciphers may contain spaces (Aristocrats) or may have spaces removed (Patristocrats). Mono-alphabetic ciphers may use K1, K2, or random alphabets as defined by the ACA.

Solving a mono-alphabetic substitution cipher using patterns

Table of letter frequency in English.

This may be the most common way to solve a cipher on a Code Busters test, because the supervisor may not write that a Caesar cipher etc. was used to encrypt.

First, find the corresponding letter for a few cipher letter by:

  1. Look for words that are only one letter long. These will almost always be A or I, unless the cryptogram is a poem, in which case O may be used. I usually appears at the start of the sentence, while A is usually more common.
  2. Look for repeated blocks of three. The block is often THE: THE is the most common english word, used almost twice as often as the second most common, BE.
  3. Look for frequency of letters. The 12 most frequent letters in the English alphabet are ETAOIN SHRDLU, with E being the most common by a significant margin.
  4. Look for contractions. If an apostrophe is seen in the ciphertext, it can be an easy way to start deciphering using the table below.
  5. Look for double letters. They're often LL, followed in frequency by EE, SS, OO and TT.

Two clues may give different substitution, in which case experimenting may be helpful.

Then, substitute the known letters, and gradually decode more words using the word fragments. Starting with two or three-letter words are often easier, because of the limited possibilities.

Contractions
Endings Examples
'T Won't, Don't, Isn't, Aren't, Weren't, Shouldn't, Couldn't, Didn't, Can't
'S He's, She's, It's, Who's, There's, That's
'D I'd, He'd, She'd, We'd, They'd, You'd
'M I'm
'RE You're, They're, We're
'VE They've, You've, We've
'LL I'll, He'll, She'll, We'll, They'll, It'll, Who'll

Common word patterns include

  1. axx- all or too
  2. xaxb- away, even, ever
  3. xa xb- it is (at the beginning of questions, is it)
  4. xax... at the beginning of a word is probably eve(ry)
  5. ...xxa at the end of a word is possibly lly
  6. axbycxy- science
  7. abxcx- there (most common) where or these
  8. xabx- that (most common) high or dead
  9. axbcx- which
  10. xyaxby- people
  11. xayybxx- success (abcddxxyxy- succeeded).

Keep in mind less common words may occupy these frequencies. For example xyaxby could be "indian."

Messages with Spaces and a Hint

These cryptograms are similar to those published in 20th century newspapers. These are usually solved using patterns, as described above, with the hint providing additional information to assist the decryption.

Messages with Spaces

These cryptograms are similar to NSA and diplomatic messages, and do not have a hint. These are usually solved using patterns, as described above.

Messages with Spaces and Spelling Errors

These cryptograms are similar to FBI and organized crime messages. These are often solved by patterns, with additional care:

  • The letter frequencies likely do not change, and can be applied.
  • THE and many of the most common words are seldom misspelled, unless intentionally. OF may be unintentionally misspelled as UV.
  • Piecing together words with word fragments may be more difficult. Misspelled words often sound the same as the actual word, which can be used to check the decrypted message.

Messages without Spaces

These cryptograms are similar to NSA and espionage messages, and have a hint. An example is: "UVYNYGUSZYSBZBULAPIAZUACAZZAMLGFALPERAJZNYGUUAFBR". Students are told that the last word is TODAY, and the cipher begins with a three-letter word, followed by a four-letter word.

  1. Begin by writing in TODAY. UVYNYGUSZYSBZBULAPIAZUACAZZAMLGFALPERAJZNYGUTODAY. From this, we can see that U represents T, A represents O, F represents D, B represents A, and R represents Y.
  2. Replace the cipher text with the decrypted letters. TVYNYGTSZYSBZATLOPIOZTOCOZZOMLGDOLPEYOJZNYGTTODAY
  3. The first word is a 3 letter word beginning with T, which we can guess decrypts to THE. Replace Vs with H and Y with E. THENEGTSZESAZATLOPIOZTOCOZZOMLGDOLPEYOJZNEGTTODAY
  4. In this cipher, we can see the phrase "TOCOZZOM". Because of the double Z in the middle, it can be inferred that this decrypts to TOMORROW. Replace Z with R, C with M, and M with W. THENEGTSRESARATLOPIORTOMORROWLGDOLPEYOJRNEGTTODAY.
  5. We can see the letters YOJR. This is probably YOUR. Replace J with U. THENEGTSRESARATLOPIORTOMORROWLGDOLPEYOURNEGTTODAY.
  6. The letters LG after the noun TOMORROW likely decrypt to IS. Replace L with I and G with S. THENESTSRESARATIOPIORTOMORROWISDOIPEYOURNESTTODAY.
  7. NEST probably decrypts to B, as that is the only word that makes sense in this context. THEBESTSRESARATIOPIORTOMORROWISDOIPEYOURBESTTODAY.
  8. At this point, the cipher is able to be solved using common sense. SRESARATIOP likely means PREPARATION. IOR probably means FOR. DOIPE probably means DOING. Thus, the message is THE BEST PREPARATION FOR TOMORROW IS DOING YOUR BEST TODAY.

Messages without Spaces or Hints

These cryptograms are extremely difficult and may not be tested very frequently. In the event that a test does contain one, the best method is using the patterns listed above, especially finding repeated three letter "phrases" or double letters.

Affine Cipher and Modular Arithmetic

The Affine cipher uses an alphabet of size [math]m[/math] with keys [math]a[/math] and [math]b[/math] such that [math]a,b[/math] are integers, and [math]a[/math] and [math]m[/math] are coprime (there is no positive divisor for both of them besides 1). Assuming the alphabet is of size 26, [math]a[/math] can be 1, 3, 5, 7, 9, 11 ,15, 17, 19, 21, 23 and 25. Each letter in the alphabet corresponds to a number from [math]0[/math] to [math]m-1[/math]. The most common correspondence for the English alphabet is shown below.

Alphabet
Letter 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
Number 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

The encryption formula for an Affine cipher is:

[math]E(x)=(ax+b)\bmod m.[/math]

In the formula, [math]x[/math] is the corresponding number of plaintext. For example, if encrypting N, [math]x[/math] would be 13. Essentially, numbers are plugged into the formula and the resulting number corresponds to the encrypted letter.

For this example, we encode the message CODEBUSTERS using [math]a=9[/math] and [math]b=42[/math]. To slightly speed up the process, use the fact from modular arithmetic that the function [math]ax+b[/math] does not change if we also take [math]a, b[/math] modulo 26: the function [math]9x+42[/math] is equivalent to the function [math]9x+16[/math] or [math]9x-10[/math].

Affine Cipher Encryption
Plaintext C O D E B U S T E R S
[math]x[/math] 2 14 3 4 1 20 18 19 4 17 18
[math]9x+42[/math] 60 168 69 78 51 222 204 213 78 195 204
[math](9x+42)\bmod 26[/math] 8 12 17 0 25 14 22 5 0 13 22
Ciphertext I M R A Z O W F A N W

The encrypted message is IMRAZOWFANW.

To decrypt the message given the key, use the decryption formula:

[math]D(x)=a^{-1}(x-b)\bmod 26[/math]

In this case, [math]a^{-1}[/math] is the multiplicative inverse of [math]a[/math] modulo [math]m[/math] ([math]aa^{-1}\bmod m=1[/math]). Because there are only 26 values, one can brute force it to find the value of [math]t[/math] where [math]ta \bmod m=1[/math]. [math]t[/math] represents [math]a^{-1}[/math].

Brute Force Table
[math]t[/math] 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
[math]9t \bmod 26[/math] 9 18 1 10 19 2 11 20 3 12 21 4 13 22 5 12 14 23 6 15 24 7 16 25 8 17

The table reveals that [math]a^{-1}=3[/math]. Below is a table of [math]a^{-1}[/math] for [math]m=26[/math]:

Inverse Table ([math]m=26[/math])
[math]a[/math] 1 3 5 7 9 11 15 17 19 21 23 25
[math]a^{-1}[/math] 1 9 21 15 3 19 7 23 11 5 17 25

Decrypting then becomes a task of plugging into the formula.

Decryption Table
Ciphertext I M R A Z O W F A N W
[math]x[/math] 8 12 17 0 25 14 22 5 0 13 22
[math]3(x-42)[/math] -102 -90 -75 -126 -51 -84 -60 -111 -126 -87 -60
[math]3(x-42) \bmod 26[/math] 2 14 3 4 1 20 18 19 4 17 18
Plaintext C O D E B U S T E R S

Sometimes, some characters are given, which makes decryption much easier. For example, one might be given the ciphertext "CXWZ ZRC OWGW" and told that the first word is "EDIT". Thus, the characters are mapped as:

Plaintext Ciphertext
E (4) C (2)
D(3) X (23)
I (8) W (22)
T (19) Z (25)

Write out two equations using the first two values and the equation [math]Output=ax+b \bmod 26[/math] in order to solve for [math]b[/math].

[math]a\cdot4+b\bmod 26=2[/math]

[math]a\cdot3+b\bmod 26=23[/math]

Cancel out the [math]a[/math] by multiplying to get the same value (same process as solving a system of equations).

[math]12a+3b\bmod 26=6[/math]

[math]12a+4b\bmod 26=92[/math]

Subtract the equations.

[math]b\bmod 26=86[/math]

Take the mod of the right side.

[math]b\bmod 26=8[/math]

Compute the modulus values to see which works. In this case, 8 works. Now, substitute [math]b[/math] into the equation and repeat the process.

[math]a\cdot3+8\bmod 26=23[/math]

[math]a\cdot3\bmod 26=15[/math]

[math]a=5[/math]

Alternatively, you can also solve by cancelling out the b's.

[math]4a+b=2(\bmod 26)[/math]

[math]3a+b=23(\bmod 26)[/math]

Subtract the two equations and eliminate the b.

[math]a=-21(\bmod 26)[/math]

Now add 26 (or 0 mod 26):

[math]\boxed{a=5}[/math]

To solve for b, plug it back into one of the equation:

[math]5\cdot4+b=2(\bmod 26)[/math]

[math]20+b=2(\bmod 26)[/math]

[math]b=-18(\bmod 26)[/math]

[math]\boxed{b=8}[/math]



Vigenère Cipher

The Vigenère cipher, invented by Blaise de Vigenère in the 16th century, is a polyalphabetic cipher (this means that it is a substitution cipher but uses multiple substitution alphabets, so if A decrypts to B at some point, it does not necessarily mean that all of the A's will decrypt to B). This means that each letter is shifted by a different amount. According to the rules, students will probably be asked to encrypt rather than decrypt Vigenère ciphers. Encrypting is a fairly straightforward procedure.

Encryption/Decryption With a Table

First, write out the message with the key under it, repeating the key as many times as necessary. An example is shown.

Message with Key
Message S C I E N C E O L Y M P I A D I S C O O L
Key S C I O L Y S C I O L Y S C I O L Y S C I

Then, take out the alphabet square, as shown below. This will typically be provided on the test.

Vigenère Alphabet Table

Using the alphabet square, encode the plaintext. The first message letter is S and the first key letter is S, therefore, look at the table to see where row S and column S intersect. It is clear that they intersect at K, so write down K as the first letter of the ciphertext. Repeat this with the rest of the message. Thus, the encrypted text is "KEQSYAW QTMXNACL WD AGQT"

If the key and ciphertext are both given, decoding is also possible. This is done by taking a letter of the key and finding its row, finding the corresponding letter of ciphertext in that row, and seeing what column that letter falls in. The letter in the column is the letter of the plaintext. In the previous example, the first letter is decoded by going to row S and finding K, which is located in column S. Thus, the plaintext letter is S.

Encryption/Decryption Without a Table

Tables are typically given on the test, but in the event they are not, the following strategy may be more helpful.

Remember or recreate the correspondence between letter and number like in Affine and Hill Cipher, with A being 0 and Z being 25. Then, for each letter, convert the plain text and key to a sequence of numbers, and add the numbers modulo 26. Then, convert the number back to letter.

For example, if we encode the message "SCIENCEOLYMPIADISCOOL" using the key SCIOLY, we get

VigenereExample.png

To decode a message using this method, subtract instead of add the key's corresponding number: The cipher text K with the corresponding key letter S gives plain text [math]10-18=-8\equiv18\pmod{26}\to \text{S}[/math].

Baconian Cipher

The Baconian cipher replaces each letter of the plaintext with a 5 letter combination of 'A' and 'B'. This replacement is a binary form of encoding, in which 'A' may be considered as 0 and 'B' as 1. One variant of the Baconian Cipher uses a 24 letter alphabet with the letters 'I' and 'J' having the same code, as well as 'U' and 'V'.

Baconian Alphabet (24-Letter Variant)
Letter 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
Code aaaaa aaaab aaaba aaabb aabaa aabab aabba aabbb abaaa abaaa abaab ababa ababb abbaa abbab abbba abbbb baaaa baaab baaba baabb baabb babaa babab babba babbb
Binary 00000 00001 00010 00011 00100 00101 00110 00111 01000 01000 01001 01010 01011 01100 01101 01110 01111 10000 10001 10010 10011 10011 10100 10101 10110 10111

Another variant of this cipher uses a unique code for each letter (26 letter alphabet). However, in a rule clarification, only the 24 letter variation is to be used on Codebusters tests for the 2019 season.

Baconian Alphabet (26-Letter Variant)
Letter 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
Code aaaaa aaaab aaaba aaabb aabaa aabab aabba aabbb abaaa abaab ababa ababb abbaa abbab abbba abbbb baaaa baaab baaba baabb babaa babab babba babbb bbaaa bbaab
Binary 00000 00001 00010 00011 00100 00101 00110 00111 01000 01001 01010 01011 01100 01101 01110 01111 10000 10001 10010 10011 10100 10101 10110 10111 11000 11001

Standard numbering systems use a base 10 method of counting (ones place, tens place, hundreds place, etc). What this means is that normally for example 24 = (2*10 + 4*1). The Baconian Cipher uses a base 2 system. The following is an example of base 2 converted to standard base 10: 01001 (base 2) = (0*16 + 1*8 + 0*4 + 0*2 + 1*1) = (1*8 + 1*1) = 9 (base 10). As seen in the chart above, 01001 corresponds to J, which is the 9th letter in the alphabet (assuming A = 0). When the first variant is shown, the numbering system will be off by 1 from J to U and off by 2 from V to Z. For example, 10100 = W, even though 10100 = 20 (base 10) which corresponds to U on the alphabet chart when A = 0.

When solving a question encoded with the Baconian Cipher, it is very likely that they won't explicitly give you "A" and "B" to use to find the corresponding letters. Most of the time, they'll have certain symbols or letters that are meant to represent "A" and "B". One example of this would be using all of of the even letters in the alphabet to represent "A" while all the odd letters represent "B". There are many different variants of this, including symbols on a keyboard and vowel/consonants. To solve a Baconian, try to group the different symbols/letters into two groups based on their properties, and assign one group "A" and the other group "B". If it doesn't work the first time, then switch the groups so that the previous "A" group is now the "B" group. If even then it doesn't seem to be working, then start over again and find a different characteristic to base the groups off of. For this reason, the Baconian Cipher can take longer than some of the other ciphers.

Xenocrypt

At the invitational/Regional level, one cryptogram may be in Spanish as a challenge. At the state level, there will be at least one. It may be helpful if one of the partners is fluent in or has a few years of knowledge in Spanish.

For Spanish cryptograms, n and ñ are treated as different letters. However, letters with accents are treated the same as without (a and á are the same). This means that, when working with cryptograms, accent marks do not factor in. Also, ch, ll, and rr are NOT considered distinct letters. Thus, "churro" would have 6 letters: c-h-u-r-r-o. The Spanish alphabet used for cryptograms is as follows:

Spanish Alphabet
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

The frequency table of Spanish letters is as follows, from most to least frequent:

Spanish Letter Frequency Table
Letter E A O S N R I L U D T C M P
Frequency 14.08% 12.16% 9.20% 7.20% 6.83% 6.41% 5.98% 5.24% 4.69% 4.67% 4.60% 3.87% 3.08% 2.89%
Letter B H Q Y V G F J Z Ñ X K W
Frequency 1.49% 1.18% 1.11% 1.09% 1.05% 1.00% 0.69% 0.52% 0.47% 0.17% 0.14% 0.11% 0.04%

Spanish cryptograms are often solved with patterns as well, with a few differences:

  • Look for the two most common letters, instead of the most common letters: E and A have relatively close frequency, and are much higher than the rest.
  • The most common spanish words are DE, LA, QUE, EL, EN. Since Spanish has far more two-letter words, it is helpful to decrypt them, using the placement of the letter E. QUE is the most common three-letter word, almost twice as common as the next ones.
  • Decrypting words using word fragments are much more difficult for teams without fluency in Spanish.

Hill Cipher

NOTE: These cryptograms will be matrix based, and only use 2x2 or 3x3 matrices.

The alphabet for the Hill cipher has corresponding numbers as follows:

Hill Cipher Alphabet
Letter 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
Number 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

Begin by picking a key matrix of either 2x2 or 3x3. These could be a 4 letter word or three 3 letter words. For this example, the key will be WIKI (2x2 matrix). Then, break the message into groups of two. This example will use the message SCIENCE OLYMPIAD, which would be split up into SC IE NC EO LY MP IA DZ. Notice that a Z is added in order to make the last group a group of two. Write the message and the key as matrices.

[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} S \\ C \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 18 \\ 2 \end{pmatrix}=\begin{pmatrix} 412 \\ 196 \end{pmatrix}\bmod 26=\begin{pmatrix} 22 \\ 14 \end{pmatrix}=\begin{pmatrix} W \\ O \end{pmatrix}[/math]

In the second step of the above equation, the matrices are multiplied. Although it may seem complicated, matrix multiplication is fairly straightforward.

[math]\begin{pmatrix} A & B \\ C & D \end{pmatrix}*\begin{pmatrix} E \\ F \end{pmatrix}[/math]

The matrices are multiplied as follows: [math]A[/math] and [math]E[/math] are multiplied, then added to the product of [math]B[/math] and [math]F[/math]. [math]C[/math] and [math]E[/math] are multiplied and added to the product of [math]D[/math] and [math]F[/math]. Thus, the product of the matrices is:

[math]\begin{pmatrix} AE + BF \\ CE + DF \end{pmatrix}[/math]

Matrix multiplication for 3x3 matrices is very similar.

[math]\begin{pmatrix} A & B & C \\ D & E & F \\ G & H & I \\ \end{pmatrix}*\begin{pmatrix} J & K & L \\ M & N & O \\ P & Q & R \\ \end{pmatrix}[/math]

Just like in a 2x2 matrix, the row of the first matrix is multiplied by the column of the second matrix, giving the following product.

[math]\begin{pmatrix} AJ+BM+CP & AK+BN+CQ & AL+BO+CR \\ DJ+EM+FP & DK+EN+FQ & DL+EO+FR \\ GJ+HM+IP & GK+HN+IQ & GL+HO+IR \\ \end{pmatrix}[/math]

It is important to note that in order to multiply matrices, the number of columns in the first matrix MUST equal the number of rows in the second matrix. The size of the product matrix is the number of rows in the first matrix x the number of columns in the second matrix.

The "mod" operation is also fairly straightforward. Essentially, it finds the remainder after dividing. For example, [math]153 \bmod 26 [/math] is equal to the remainder of [math]153 / 26[/math], which is 23. On a scientific calculator, this is found by dividing the two numbers, subtracting the integer value from the answer, and multiplying the decimals by the number after "mod" (in this case, 26). Therefore, the process would be:

[math]153/26=5.884615385[/math]

[math]5.884615385-5=0.884615385[/math]

[math]0.884615385*26=23[/math]

The rest of the encoding of the message is shown below.

[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} S \\ C \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 18 \\ 2 \end{pmatrix}=\begin{pmatrix} 412 \\ 196 \end{pmatrix}\bmod 26=\begin{pmatrix} 22 \\ 14 \end{pmatrix}=\begin{pmatrix} W \\ O \end{pmatrix}[/math]

[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} I \\ E \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 8 \\ 4 \end{pmatrix}=\begin{pmatrix} 208 \\ 112 \end{pmatrix}\bmod 26=\begin{pmatrix} 0 \\ 8 \end{pmatrix}=\begin{pmatrix} A \\ I \end{pmatrix}[/math]

[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} N \\ C \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 13 \\ 2 \end{pmatrix}=\begin{pmatrix} 302 \\ 146 \end{pmatrix}\bmod 26=\begin{pmatrix} 16 \\ 16 \end{pmatrix}=\begin{pmatrix} Q \\ Q \end{pmatrix}[/math]

[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} E \\ O \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 4 \\ 14 \end{pmatrix}=\begin{pmatrix} 200 \\ 152 \end{pmatrix}\bmod 26=\begin{pmatrix} 18 \\ 22 \end{pmatrix}=\begin{pmatrix} S \\ W \end{pmatrix}[/math]

[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} L \\ Y \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 11 \\ 24 \end{pmatrix}=\begin{pmatrix} 434 \\ 302 \end{pmatrix}\bmod 26=\begin{pmatrix} 18 \\ 16 \end{pmatrix}=\begin{pmatrix} S \\ Q \end{pmatrix}[/math]

[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} M \\ P \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 12 \\ 15 \end{pmatrix}=\begin{pmatrix} 384 \\ 240 \end{pmatrix}\bmod 26=\begin{pmatrix} 20 \\ 6 \end{pmatrix}=\begin{pmatrix} U \\ G \end{pmatrix}[/math]

[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} I \\ A \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 8 \\ 0 \end{pmatrix}=\begin{pmatrix} 176 \\ 80 \end{pmatrix}\bmod 26=\begin{pmatrix} 20 \\ 2 \end{pmatrix}=\begin{pmatrix} U \\ C \end{pmatrix}[/math]

[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} D \\ Z \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 3 \\ 25 \end{pmatrix}=\begin{pmatrix} 226 \\ 230 \end{pmatrix}\bmod 26=\begin{pmatrix} 18 \\ 22 \end{pmatrix}=\begin{pmatrix} S \\ W \end{pmatrix}[/math]

The encoded message is WOAIQQSWSQUGUCSW.

3x3 matrix encryption works in the same way. This example will encrypt "EDIT THE WIKI" using the key "BEE FLY BUG". First, split up the plaintext into groups of three, which becomes EDI TTH EWI KIZ. Once again, the last group has a Z added to make it a group of three.

[math] \begin{pmatrix} B & E & E \\ F & L & Y \\ B & U & G \end{pmatrix}*\begin{pmatrix} E \\ D \\ I \\ \end{pmatrix}=\begin{pmatrix} 1 & 4 & 4 \\ 5 & 11 & 24 \\ 1 & 20 & 6 \end{pmatrix}*\begin{pmatrix} 4 \\ 3 \\ 8 \end{pmatrix}=\begin{pmatrix} 48 \\ 245 \\ 112 \end{pmatrix}\bmod 26=\begin{pmatrix} 22 \\ 11 \\ 8 \end{pmatrix}=\begin{pmatrix} W \\ L \\ I \end{pmatrix}[/math]

[math] \begin{pmatrix} B & E & E \\ F & L & Y \\ B & U & G \end{pmatrix}*\begin{pmatrix} T \\ T \\ H \\ \end{pmatrix}=\begin{pmatrix} 1 & 4 & 4 \\ 5 & 11 & 24 \\ 1 & 20 & 6 \end{pmatrix}*\begin{pmatrix} 19 \\ 19 \\ 7 \end{pmatrix}=\begin{pmatrix} 123 \\ 472 \\ 441 \end{pmatrix}\bmod 26=\begin{pmatrix} 19 \\ 4 \\ 25 \end{pmatrix}=\begin{pmatrix} T \\ E \\ Z \end{pmatrix}[/math]

[math] \begin{pmatrix} B & E & E \\ F & L & Y \\ B & U & G \end{pmatrix}*\begin{pmatrix} E \\ W \\ I \\ \end{pmatrix}=\begin{pmatrix} 1 & 4 & 4 \\ 5 & 11 & 24 \\ 1 & 20 & 6 \end{pmatrix}*\begin{pmatrix} 4 \\ 22 \\ 8 \end{pmatrix}=\begin{pmatrix} 124 \\ 454 \\ 492 \end{pmatrix}\bmod 26=\begin{pmatrix} 20 \\ 12 \\ 24 \end{pmatrix}=\begin{pmatrix} U \\ M \\ Y \end{pmatrix}[/math]

[math] \begin{pmatrix} B & E & E \\ F & L & Y \\ B & U & G \end{pmatrix}*\begin{pmatrix} K \\ I \\ Z \\ \end{pmatrix}=\begin{pmatrix} 1 & 4 & 4 \\ 5 & 11 & 24 \\ 1 & 20 & 6 \end{pmatrix}*\begin{pmatrix} 10 \\ 8 \\ 25 \end{pmatrix}=\begin{pmatrix} 142 \\ 738 \\ 320 \end{pmatrix}\bmod 26=\begin{pmatrix} 12 \\ 10 \\ 8 \end{pmatrix}=\begin{pmatrix} M \\ K \\ I \end{pmatrix}[/math]

The encoded message is WLITEZUMYMKI.

When given 4 corresponding plaintext and ciphertext create two sets of equations and solve them. For example if ABCD plaintext corresponds to DCBA and you have to find the encryption key [math]\begin{pmatrix} A & B \\ C & D \\ \end{pmatrix}[/math] create 2 matrices with AB and CD [math]\begin{pmatrix} 0\\ 1\\ \end{pmatrix}[/math] [math]\begin{pmatrix} 2\\ 3\\ \end{pmatrix}[/math] You get 0A plus 1B = 3 and 0C plus 1D = 2 2A plus 3B = 1 and 2C plus 3D = 0 With 0A plus 1B = 3 times 3 is 0A plus 3B = 9 2A plus 3B = 3 minus (0A plus 3B = 9 2A = -6 mod 26 or 2A=20 A value = 10 Repeat for other values

Morse Ciphers

The Morse ciphers are a pair of ciphers where you are given a long text of numbers, where each number corresponds to one or two Morse characters (dot, dash, or a separator). Some of these number values will be given while some will not. Using the properties of Morse code and logical thinking, you must find the decryption for all of the missing numbers.

The dot and dash are self-explanatory. Separators, however, have two use cases:

  1. Letter separator: In this case, there will be one separator character (like an X) which separates two letters.
  2. Word separator: In this case, there will be two separator characters which separate two words.

There can never be more than two separator characters in a row. This is very useful when solving because it allows you to eliminate the possibility of a number next to two separators being another separator.

Pollux Cipher

In a pollux cipher, each number corresponds to one Morse character. In a pollux cipher (and only in a pollux cipher), the quote cannot end with a separator.

An example question is given below.

Decode this quote which has been encoded using a Pollux Cipher, where 1 = x, 5 = x, 9 = x, 3 = •, 0 = •, 2 = -, and 7 = -.

086393425702417685963041456234908745360

First, you would replace the numbers you know already with their corresponding Morse characters.

•86• X •4- X -•-4 X -68 XX 6••4 X 4 X 6-•4 X •8-4 X •6•

Now, we turn our attention to the number 4 that is in between two X's. We know that this cannot be an X since that would put three X's in a row (which is illegal). This means it can only be a dash or a dot. In this scenario, you would look for another place where 4 is included, preferably with no other numbers and separators around it.

At the beginning, we have "X •4- X -•-4 X". If we were to substitute a dot or dash in for the number 4, we would have two complete letters! Let's say you substituted 4 for a dash. This would give you "X •-- X -•-- X", which translates to "WY" (note that we ignore the "X"s since they are just separators and not actual letters). Although seeing "WY" is probably possible, it is very unlikely. If you were to instead substitute 4 for a dot, you would get "X ••- X -•-• X", which translates to "UC"! This is a much more probable combination, and you can probably already think of possible words like "suck" or "chuck".

Now, you can go ahead and replace all of the 4's with a •.

•86• X ••- X -•-• X -68 XX 6••• X • X 6-•• X •8-• X •6•

Once you start seeing pieces of Morse characters separated by X's, you can then begin translating them to get your first few letters!

•86• X U X C X -68 XX 6••• X E X 6-•• X •8-• X •6•

This is where you have to make a decision. If you chose to try finding out what the number 6 is, you could do the same process as we did for the number 4 using the four pieces separated by X's that only have a 6 in them (these are "6•••", "6-••", and "•6•"). However, you could also try to find out what the number 8 is. Since you do not have multiple pieces with only an 8 in them, this would be slightly more difficult.

Let's assume you went with finding out what the number 6 is. Here, you can make a very keen observation if you were to look at the piece "6•••". The Morse alphabet only has one letter that ends with three dots: the letter H! Since H starts with a dot, you now know that 6 is also a dot.

You can now substitute a dot in for the number 6 and translate letters.

•8•• X U X C X -•8 XX H X E X L X •8-• X S

At this point, you are only missing the number 8. You know it cannot be X (hint: look at the piece "X -•8 XX" and recall the rules of separators). Now, it is purely up to your personal preference as to which string you look at. For this example, let's look at the last piece with a number 8. This entire word reads, "HEL_S". You can probably guess that the blank has to be a P to spell out "HELPS", but let's pretend you didn't know that. The template we have is "•8-•". This piece can be either "••-•" or "•--•", since the number 8 can only be a dot or a dash. If it were "••-•", then this word would be "HELFS", which doesn't make sense. If you were to instead try "•--•", you would end up with the word "HELPS"!

Now, knowing your final number (that 8 is a dash), you can substitute this in and translate!

L X U X C X K XX H X E X L X P X S

Luck helps! Don't forget to ignore the X's that are separators, or you will end up with a very strange piece of text. For this reason, you may want to use another character, like / or | instead of an X to avoid confusion.

Morbit Cipher

In a morbit cipher, each number corresponds to two Morse characters. Each pair of Morse character can only correspond to one number, meaning there are only nine possible decryptions. Whereas pollux quotes cannot end with a separator, morbit ciphers may or may not end with a separator. This is because each number has to correspond to two Morse characters, so an extra separator is added at the end if the quote in Morse code is an odd number of characters.

An example question is given below.

Decode this quote which has been encoded using a Pollux Cipher, where 5 = •-, 7 = -x, 1 = x•, 4 = -•, 8 = •x, and 2 = --.

27435881512827465679378

We first begin by substituting what we already know. This should always be the first thing you do when you see a Morse cipher!

--- X -•3•-• X • XX ••- X •--• X --- X -•6•-6- X 93- X • X

Here, we can see what was mentioned above. Since the quote has an odd number of Morse characters, it ends with an X (separator) to make sure the last number corresponds to two Morse characters. Now, we can begin translating the Morse pieces we know completely into letters!

O X -•3•-• X E XX U X P X O X -•6•-6- X 93- X E X

It is important to remember here that X's are separators and not part of the quote. This quote does not contain any X's, but it is recommended that you use a different separator on an actual test so that you do not get confused if the quote does contain an X.

Here, we can apply a very important piece of knowledge about Morse code: No letter translates to more than four Morse characters (dots and dashes). Near the beginning, we see there is a piece that reads "X -•3•-• X". On the left of the number 3, we see two Morse characters, and on the right we see three. If the decryption of the number 3 did not contain an X, then this piece would be illegal because it would contain 2 + 2 + 3 = 7 Morse characters in a row!

To figure out what the number 3 decrypts to, we can try substituting "X_" (separator followed by a blank that could be a dot or a dash) and "_X" (the first option but backwards). First trying "X_", we have "X -• X _•-• X". This translates to "N _", where the blank is another letter. This letter should look like "_•-•" in Morse. Using our knowledge of the Morse alphabet, we know that the two letters that match this pattern are "••-•" (F) and "-•-•" (C). "NF" and "NC" are both reasonable, but we already know most of the first word, "O_E" (taking the two letters from the ciphertext above). This means it could either be "ONFE" or "ONCE", and it is clearly the latter. This means that the number 3 is probably "X-"! Although we didn't try the possibility of the number 3 being "_X", you can try this yourself using the same strategy used above to see that it is probably not correct.

Now, we can substitute the number 3 in!

O X -• X -•-• X E XX U X P X O X -•6•-6- X 9 X -- X E X

Translating the new Morse pieces we know, we find out a few more letters.

O X N X C X E XX U X P X O X -•6•-6- X 9 X M X E X

If you spent just 30 seconds staring at this, you might be able to guess what the remaining letters are without even working the Morse out! Let's continue with the Morse anyways.

At this point, we have two numbers left, 6 and 9. If we were to look at the number 6, we can apply the same logic as we did with the number 3 using the fact that Morse letters are no longer than 4 characters. For sake of example, however, let's take a look at the number 9. We see that it is a single number surrounded by X's, meaning it cannot contain an X. Although you may think this does not cut down the possibilities very much, recall a key fact about the morbit decryptions: each Morse code pair (like ••, •-, •x, etc.) can only correspond to one number. Let's make a table of which numbers and pairs we have so far!

1 2 3 4 5 6 7 8 9
x• -- x- -• •- ? -x •x ?

The only Morse code pairs we are missing are "XX" and "••". However, we already established that the number 9 cannot contain an X, meaning it has to be "••". By process of elimination this means that the number 6 has to be "XX"!

We now have all the numbers figured out and can substitute the remaining ones in for their Morse decryption.

O X N X C X E XX U X P X O X -• XX •- XX - X •• X M X E X

Translating Morse to the alphabet and removing the separators, we have

ONCE UPON A TIME

This example is slightly unrealistic since obvious clues were ignored and the quote is quite short. However, all principles of solving a morbit cipher have been shown so you can use them in any morbit cipher you see, regardless of difficulty!

Running Key Cipher

The running key cipher is a variant of the Vigenère Cipher. Rather than using a word as a key, a sentence/paragraph is used as the key. Essentially, instead of repeating a word multiple times as the key, a sentence/paragraph constitutes as the key and is used continuously. If the test was made with Toebes, then the four standard documents used to create a question using the Running Key Cipher are:

  • The first line of the Gettysburg Address
  • The first line/paragraph of the Declaration of Independence
  • The first line of the United States Consitution
  • The first line of the Magna Carta (in Latin)

In the event that a question encoded with the running key cipher asks you to decode the phrase but does not give the key for it, then one has to use one of the documents given on the reference sheet (if applicable) and plug them all in to determine which of the documents is the key. If they give the key but do not give the text of the key (ex. "a famous quote by George Washington"), then it is probably best to skip the question.

RSA Cipher

Choose two primes [math]p[/math] and [math]q[/math].

Compute [math]n = pq[/math].

Compute the least common multiple of [math]p-1[/math] and [math]q-1[/math], and call it [math]\lambda(n)[/math].

Choose an integer [math]e[/math] coprime to [math]\lambda(n)[/math].

Compute the inverse [math]d[/math] of [math]e[/math] modulo [math]\lambda(n)[/math].

Now, say that Alice wants to receive from Bob a message. Alice sends Bob her public key (n, e) through a reliable channel. Bob translates his message M to an integer m, and then converts it to ciphertext using [math]c \equiv m^e mod n[/math].

Alice decodes it using [math]m \equiv c^d mod n[/math].


Sir Arthur Conan Doyle's Cipher from The Adventure of the Dancing Men

While not explicitly stated in the rules, the Dancing Men cipher has appeared in previous tests and possibly may appear as a bonus question in future tests. The Dancing Men cipher is a monoalphabetic substitution cipher with spaces where each letter is represented by a dancing man. A man holding a flag indicates the end of a word. In the story, messages encrypted with this cipher were sent to a woman named Elsie, Sherlock Holmes solved the cipher using that E is the most common letter, and that Elsie's name would likely appear. Since the cipher may be easily decrypted if all the dancing men are memorized, there are a few patterns to help remember them. O and A, R and I, and T and E are flipped. T and E are symmetrical about a vertical axis. N and S have the same legs and right arm. The substitution chart is found below.

Dancing Men Cipher

An example of the Dancing Men cipher is listed below.

DancingMenCipherExample.png contains the message "NOTARIES", which conveniently shows the patterns listed above.

Note: The Dancing Men cipher is not included in 2019 rules. However, it is a common part of tests from past years' trial events.

External Links

Trial event rules
2016 Nationals
2018 trial rules
Cryptogram Workbook (lots of practice problems, 139 pages)
Mono-alphabetic Substitution Cipher Practice
Game-like Cryptogram Practice
Cipher Tools and Practice Tests
Cipher Solver. Can be used to find common words for specific patters.