Training the Next Generation


My day job involves warping, um teaching young minds the art of computer programming. Every now and then I get to slip in something fun.

This assignment is one where the students do a completely automated decryption of what was up until well after WW2 a state of the art cryptosystem.  While I did weaken it a little (a short key rather than a very long one), the linearity of the cipher is a fundamental weakness. More than a few of the students did the whole project, and at least one found it pretty cool. Cool enough to think about working for one of those un-nameable three letter agencies.

The basic techniques were used at Bletchley Park both for Enigma and Lorenz.


Although largely by hand (until they built the machines) in small dark offices like this one. (Turing’s). Could you do it?

Assignment 8


due November 5 2015

Another encryption assignment

  1. Vernam Encryption Write a program in C that will encrypt a file use XOR and a Vernam key. A Vernam key is a short string. (The real system used a much longer random sequence.) Read the input at low level, as binary data (hint unsigned char is useful here.) Then xor each character in the binary data with the character in the key. When you get to the end of the key reuse the key from the beginning.

The program should take command line arguments for the key, input and output.

./vern abc input.clear output.encrypted

Note that the cipher should decrypt its own output. The command:

./vern abc output.encrypted input.clear

should recover the original input. If you use open to create the output file, you may want to also set O RDWR or O WRONLY as well as O CREAT. You could also use fread and fwrite for this problem.

  1. Finding the period

This cipher is vulnerable if the key repeats, and with a short key, like abc above, it will repeat many times for any reasonably sized input.

The incidence of coincidence slides the cipher along itself and counts the number of times the same symbol is seen.

ABCABCABC            count is 9

ABCABCABC then shift 1 ABCABCABC        count is 0

ABCABCABC then shift 2 ABCABCABC      count is 0

ABCABCABC then shift 3 ABCABCABC    count is 6


Clearly the period is 3.

Write the code to do that. The file classcipher.vrn is in my directory for this.

  1. EXTRA CREDIT The character ’ ’ (space) is most common in English text. After finding the period count the most common character for each period and recover the key by XOR’ing it with ’ ’.

Author: rharrisonauthor

International man of mystery. Well not really, although I can mangle several languages and even read the occasional hieroglyphic. A computer scientist, an author and one of the very few people who has both an NIH grant and a book contract. A rising author of sweet romantic historical fiction. A booktrope author.