The Affine cipher (gets it name from the definition of an affine function which is a combination of a translation and scaling) is another example of a substitution cipher where each letter is replaced by another based on some rule.

Encryption

The affine cipher key consists of a pair of integers (a, b) which is used to are used to form the equation ax+b and subsequently used to generate the mapping of each plaintext character to ciphertext character.

Take (3, 5) as an example. Note a must be a co-prime (have no common factors other than 1) to 26 otherwise different characters may map to the same letter and thus wouldn’t be reversible. In group theory this is because a needs to be cyclic generator of the group Z/26Z

If you need a reminder on how the Caesar Cipher works click here.

The Caesar Cipher is a very easy to crack as there are only 25 unique keys so we can test all of them and score how English they are using either Chi-Squared Statistic or N-Gram Probability.

As you can see the lowest Chi-Squared value is 51.921327, which was using a shift of 21. If you read the decrypted text for a shift of 21 you can indeed see that it is English. Hence cipher has been broken!

TheÂ Caesar Cipher is one of the most commonly used and simplest ciphers, named afterÂ Julius Caesar, it is a great place to start learning about ciphers.

Encryption

The key is an integer normally known as the ‘shift’, it can be a number from 0-25 (0 being the identity). First you create your alphabet mapping of plaintext letters (lowercase) to ciphertext letters (uppercase) using the shift.

Some examples a shifts would look like this
Shift of 1: Shift of 21:
abcdefghijklmnopqrstuvwxyz abcdefghijklmnopqrstuvwxyz
BCDEFGHIJKLMNOPQRSTUVWXYZA VWXYZABCDEFGHIJKLMNOPQRSTU

For each letter in your plaintext you replace it it with its corresponding ciphertext letter (the one below it in the mapping).

It can also be thought of like converting each letter to is equivalent value (A=0, B=1…. Z=25 etc) and adding the key shift, and subtracting 26 if the value is 26 or greater,Â then convert back to letters.

Example:

Encrypting “when the clock strikes twelve attack” using the shift of 21

when the clock strikes twelve attack
RCZI OCZ XGJXF NOMDFZN ORZGQZ VOOVXF

Decryption

For each letter in your ciphertext you replace it it with its corresponding plaintext letter (the one above it in the mapping).

You can also convert each letter to is equivalent value (A=0, B=1…. Z=25 etc) and subtract the key shift this time, and add 26 if the value smaller than 0,Â then convert back to letters.

VWXYZABCDEFGHIJKLMNOPQRSTU - Shift of 21:
abcdefghijklmnopqrstuvwxyz
RCZI OCZ XGJXF NOMDFZN ORZGQZ VOOVXF
when the clock strikes twelve attack

As we are working in modular 26 a shift of -5 is the same as a shift of 21. The inverse key of 21 would be 5.

If you need a reminder on how the Nihilist Substitution Cipher works click here.

To find the period you assume it is a particular period and put in blocks of 2 in columns of the period, then you do an diagraphic index of coincidence calculation on each column and take the average of all the columns.

This is an example of the difference between the expected English index of coincidence (0.0667) and the average Index of Coincidence Calculation for periods 2-40. Hence the smaller the bar the closer it is to that of English.

As you can see for this particular text it is very obvious that the period is 3 because all the of multiples of 3s are very close to English. This is because the key ‘MAN’ – period 3 is the same as ‘MANMAN’ – period 6.

Once the period has been identified place the ciphertext intoÂ blocks of 2 in columns of the correct period.

Example:
345173345643531536543672… has been found to have a period of 3

From this point on you treat each column separately as they are all encoded by a different letter. Â From here we use each number digraph to narrow down the possible keys. We can infer things from ciphertext for example if the second digit is 0 there was only one way it could have been created that would be the plaintext number and the key number ending in a 5.

This can be extended to create inequalities for all possible ciphertext number digraphs. This is some pseudocode to create an inequalities for both the row and column.

rowMin = 1
rowMax = 5
colMin = 1
colMax = 5
no = ciphertext number digraph
IF no is smaller than 11 THEN
no = no + 100
col = no % 10
IF col equals 0 THEN
colMin = 5
colMax = 5
no = no - 10
ELIF col smaller than 7 THEN
colMin = 1
colMax = col - 1
ELSE
colMin = col - 5
colMax = 5
row = floor(no / 10) % 10
IF row equals 0 THEN
rowMin = 5
rowMax = 5
ELIF row smaller than 7 THEN
rowMin = 1
rowMax = row - 1
ELSE
rowMin = row - 5
rowMax = 5

You apply this algorithm to all number digraphs in each columnÂ and then create an equation for the row and column of the key number. The equation will be…

rowMin <= row <= rowMax
colMin <= col <= colMax

You then use these to narrow down the possibility, lets say you had the inequalities …

2 <= row <= 4 & 3 <= row <= 5 & 2 <= row <= 3

From these three inequalities you can infer that:

3 <= row <= 3 hence row = 3

So you now know that for that columns the key number must starts with a 3. You can then get theÂ inequalities for the column and then create the full key which in this case will now be 31, 32, 33, 34 or 35.

Once the key has been found for each column subtract it away from each number in its respective column. Now if there have been no mistakes there should be less than 25 (size of polybius square with I/J being 1 character) number digraphs. Convert each unique one into a unique letter. Example: swap out all 24 for ‘A’s all 45 for ‘B’s, all 86 for ‘C’s etc.

You are now left will a simple substitution cipher, I wont go into detail on how to break it here, but I have a page here on how to break a simple substitution cipher. Tips: The most common letter in the new ciphertext will likely be ‘E’, the most common trigraph ‘THE’ and so on.

The Nihilist Substitution is a poly-alphabetic cipher which means it uses multiple substitution alphabets and similar to the VigenĂ¨re Cipher.

The key consists of a 5×5 polybius square which has all the letters in the alphabet however I/J are treatedÂ the same and a second key.

Â

1

2

3

4

5

1

A

B

C

D

E

2

F

G

H

I/J

K

3

L

M

N

O

P

4

Q

R

S

T

U

5

V

W

X

Y

Z

The second key can be of any length, keep in mind that the longer the key the more secure it theoretically is, however the key should be memorable so a person could remember and use it. Examples:

MAGIC, KEY, DEFEND, POLYALPHABETIC etc.

Encryption

Consider the polybius square created using the keyword CIPHER

Â

1

2

3

4

5

1

C

I/J

P

H

E

2

R

A

B

D

F

3

G

K

L

M

N

4

O

Q

S

T

U

5

V

W

X

Y

Z

and a second key of PAGE which defines the period as 4.

The second key is replaced with its position the polybius square (row then column), the numbers effectively become the key. Then each plaintext letter is Â written in rows of the period length and it too also replaced with its position the polybius square (row then column).Â The cipher text is then the sum of the key and the cipher text numbers.Â If the number is greater than 99 (3 digit number) subtract 100. 105 becomes 05, 100 becomes 00.

P A G E P A G E P A G E
13 22 31 15 13 22 31 15 13 22 31 15
----------- ----------- -----------
W H E N S T R I E A T T
52 14 15 35 43 44 21 12 15 22 44 44
65 36 46 50 56 66 52 27 28 44 75 59
----------- ----------- -----------
T H E C K E S T A C K
44 14 15 11 32 15 43 44 22 11 32
57 36 46 26 45 37 74 59 35 33 63
----------- -----------
L O C K W E L V
33 41 11 32 52 15 33 51
46 63 42 47 65 37 64 66

WHENTHECLOCKSTRIKESTWELVEATTACK using these keys encrypts to 65364650573646264663424756665227453774596537646628447559353363.

Decryption

To decrypt simply split the number text into blocks of 2 andÂ write each block in rows of the period length then subtract the key numbers. If the result is less than 0 add 100.

There are however some serious flaws that significantly decrease the security of this cipher, these flaws can be used to break the Nihilist Substitution Cipher.

To encrypt in Hill a key first needs to be chosen, this will be a square matrix which has an inverse in modular 26. For the matrix to have an inverse the determinant must be co-prime to 26.

Here are two example matrices…

(-9 mod 26) is 17 (-9+26Ă1), 17 is co-prime to 26
(-2131 mod 26) is 1 (-2131+26Ă82), 1 is co-prime to 26
Hence both these matrices are valid keys for the Hill cipher
*Co-prime means that the greatest common factor between the two numbers is 1.

If a 2 by 2 matrix is chosen for the key, the plaintext must be padded usually with an âXâ so that it is a multiple of 2. So for an N by N matrix the plaintext must be padded so that it that it is a multiple of N. E.G
For N=2, âCAREFULâ would become âCAREFULXâ
For N=2, âSPORTSâ would stay as âSPORTSâ
For N=3, âCAREFULâ would become âCAREFULXXâ
Once the text is a valid length, you take letters in blocks of N and convert them to a column vector. Letter âAâ has the value 0, âBâ is 1, âCâ is 2 âŚ âZâ is 25 etc.

Example:
, , ,
, ,

You do this for each block of N characters. Then multiply the key matrix by each column vector. You will get a new column vector which can be converted back to letters.

âCAREFULâ encodes to âEKUTSHNUâ using the key matrix M_{2}

âCAREFULXâ encodes to âDIOSDCCCRâ using the key matrix M_{3}