Skip to main content

About the challenge

The National Cipher Challenge has been run by the University of Southampton Mathematics Department since 2002 and has attracted a wide following. We count Cabinet Ministers, media scientists, journalists, authors and actors among our fans. We even had the pleasure of introducing the Cipher Challenge team from Saint Anne’s School in Southampton to the Duke of Edinburgh who, remembering his work in the second world war immediately fell in love with the competition and gave Harry a reading list for the summer.

The real fans though are the competitors who take part every year until they are too old, by which time it is too late and they are hooked. Many of them go on to careers in cyber security and others follow other paths using the mathematics and computing skills they learned tackling our fiendish challenges.

Julian went on to study Discrete Mathematics and made it to the Grand Final of the UK National Cyber Security Championship in 2013, following in the footsteps of the 2008 National Cipher Challenge winner, Jonathan Millican, who was crowned winner of the UK National Cyber Security Championship the previous year. Naomi Andrew, who operates under a code name as one of the Elves on the site, took part from Year 8 until she was sadly too old to compete, but managed to stay involved as a student at Southampton. She is now studying for her PhD here and we like to think the Cipher Challenge had an important part to play in that journey.

If I were to name one thing which has undoubtedly influenced my academic drive, interests and overall career to date, it would be the National Cipher Challenge. Since being introduced to cryptography and the challenge in Year 8, it has been my one passion and driving force in pursuing further education in maths.

Julian Bahrdwaj

The lesson PowerPoints are great to use with any year group – easy to understand with passages written in code for them to practise using the decryption methods, with little input needed from the teacher. Would recommend – especially if you are starting a Codebreaking club before the competition begins like me.

Sam Barlow, Queen Anne’s School, Caversham

Even if you can’t or don’t want to take part in the competition there is a lot here for you to enjoy.

Alongside the materials we have produced you will find everything you need to be a successful code-breaker.

We have a library full of suggestions of great books, fact and fiction, links to a whole range of videos on topics related to maths, computing and codebreaking, even a guest lecture by one of our alumni describing how he learned python to break the challenge.

We have some basic cipher tools you can use to get started including a Caesar wheel, an affine shift encryption machine and a frequency analyser to help you break down and find patterns in a ciphertext. In our cryptanalyst handbook you can find instructions to build your own cipher machines, including the simple cipher wheel and tis more sophisticated cousin the affine shift cipher wheel. Or you can go a step further and explore the fascinating Enigma machine and its cardboard twin, the Pringle Can Enigma Machine.

It was said by Niels Ferguson, one of the leading cryptographers of his generation, that cryptography was “just about the most fun you can have with mathematics”. As professional mathematicians we can think of a few others too, but we largely agree with that and hope that the Cipher Challenge will convince you too.

This edition of the competition

Following on from the special edition in Spring we thought you might like another story featuring the creation of BOSS back in 1937, so here it is.

In 1937 the western powers were locked in a growing confrontation that reminded everyone of the Great War. Germany was in the grip of the Nazi party and secretly arming itself as it tried to reassert its power. In the Reich Chancellery Hitler and his party were secretly plotting to expand their borders in a bid to dominate Europe. The other European nations were gripped by indecision, unable to gauge the growing threat and desperate to avoid another war. Against this background the Allied intelligence services were alarmed by a massive increase in the number of German tourists visiting their capitals, but with their agents fully engaged in developing new spy networks across middle Europe they did not have the resources to investigate. Luckily a new agency had recently been born. The Bureau of Security and Signals Intelligence was set up as a joint UK?US operation to fill a gap in capacity at a desperate time. This was their hour and it fell to them to determine how great a threat was posed by these visitors. Understaffed they have recruited you to help them break the German spy ring and prevent the Nazis from winning the war before it had started.


You can download lessons and notes on codebreaking from the resources page on the competition website. This is the competition library and, alongside the materials we have produced you will find links to books, online videos and help guides that contain everything you need to be a successful code-breaker. You can even build your own cipher machines, including the simple cipher wheel and the more complicated Pringle Can Enigma Machine.

Who is the competition for?

The competition is for everyone, the prizes are more restricted! We no longer collect personal information about competitors unless they are in line for a prize, so anyone can take part. The prizes (see below) are restricted to UK residents in full time school or 6th form level education, and if you are a contender for one of these we will be in touch at the end of the competition to verify eligibility. If you have any questions please contact Harry at [email protected]

How to register and join in

There is no charge to register or take part, and all you need to get involved is a reasonably modern web browser. We publish news about the competition on Twitter and you can keep up to date by following us there.

Entrants can take part alone or in teams of any size. To take part you will need to register for an account on the website, and you can find out more about that on the Registration Instructions and Joining a Team pages. You can also find out more about this in the BOSS Trainer’s Manual.

Your account will also allow you to join in on the BOSS Forums, where you can discuss a whole range of things connected to the competition, and quite a few that are totally unrelated.

Competition schedule

Registration will open on October 22nd and the first practice round will be published at 3pm on the same day. The first two rounds are designed as a warm up, and while we will publish leader boards, the marks for those challenges won’t count towards the final competition standings. The main competition starts with episode 3 on 12th November, with the remaining challenges published weekly until December 10th. NOTE: all times stated on the site refer to current UK time. The clocks change back from British Summer time at around 2am on Sunday October 25th and our competition clock will reset to GMT.

You can find a schedule for the release of challenges on the Challenge page

Scoring the Challenge

There are two parallel competitions, part A and part B, and you can take part in one or both (or neither, but why would you?) Competition B is scored for speed and accuracy. We use the Damerau-Levenshtein distance to determine how accurate you are and break up the time into bands each worth a certain number of points. For each round you can submit more than once, and we mark each of your submissions. We then take your most accurate submission and award the appropriate time points to give a pair of numbers (accuracy out of 100, time points) and then use this to rank team entries. Accuracy is ALWAYS more important than speed. Speed does matter, but you do not have to rush to download the first challenges immediately as you have a day or two in which you can still get top marks. In later challenges speed will become important, and the full schedule of marks is published on the Challenge pages so you can see how quickly you will need to get started in each round.

Challenge A is intended for less experienced code breakers, so typically the challenges are a bit easier. You will be able to download certificates showing you how well you did in each round as well as your placing in the overall competition after each round.

The first three challenges should be thought of as a “warm-up” exercise and will not count in the final leader board rankings, however it is still worth tackling them as they give excellent practice and they do develop the storyline. You will be able to download certificates recording your team’s performance at each stage.

Rewards and Prizes

This year we have a prize fund of £4,000 pounds supported in part by our very generous sponsors at GCHQ, IBM and Trinity College Cambridge. We will be awarding four prizes each to the tune of £1,000 as follows

The Alan Turing Prize and Ada Lovelace prizes for the best two individual codebreakers

The Hut 8 and Hut 33 prizes for the two best teams of codebreakers.

To be eligible for any of the prizes the winners must be in full time school or sixth form college level education in the UK. Homeschoolers also qualify, but proof of age may be required. It is also a condition that prizewinners agree that their names and affiliations may be published on the competition website. We also encourage winners to publish details to the media, but this is not a requirement. These rules apply both to individual winners and to ALL members of any winning team.

Potential winners will be contacted at the close of the competition and asked to confirm eligibility.

Finally, for the integrity of the competition it is important that winners are able to show that their entry is the result of their own work and the prize committee reserve the right to ask for reasonable evidence of this. Even if this wasn’t needed, it is absolutely fascinating to hear how these brilliant young people tackled the competition and is one of the highlights of the whole thing for Harry and the team! You can see some of the recent accounts of this on the resources page.