ArticleslgStudy

computer science

National Cipher Challenge

National Cipher Challenge is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand National Cipher Challenge rather than just read about it. In short: The National Cipher Challenge is an annual cryptographic competition organised by the University of Southampton School of Mathematics. Competitors attempt to break cryptograms published on the competition website.

Key takeaways

  • National Cipher Challenge belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect National Cipher Challenge to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of National Cipher Challenge from memory before moving on to harder problems.

Reference excerpt

The National Cipher Challenge is an annual cryptographic competition organised by the University of Southampton School of Mathematics. Competitors attempt to break cryptograms published on the competition website. In the 2017, more than 7,500 students took part in the competition. Participants must be in full-time school level education in order to qualify for prizes.

Format The competition is organised into eight to ten challenges, which are further subdivided into parts A and B. The part A challenge consists of a comparatively simpler cryptogram, and usually provides some useful information to assist in the solving of part B. Part B is usually more complex. In later challenges the cryptograms become harder to break. In the past, part A cryptograms have been encrypted with the Caesar cipher, the Affine cipher, the Keyword cipher, the Transposition cipher, the Vigenère cipher and the 2x2 Hill cipher. The part B challenges are intended to be harder. These begin with relatively simple substitution ciphers, including the Bacon cipher and Polybius square, before moving on to transposition ciphers, Playfair ciphers and polyalphabetic ciphers such as the Vigenère cipher, the Autokey cipher and the Alberti cipher. In the later stages of the competition, the ADFGVX cipher, the Solitaire cipher, the Double Playfair cipher, the Hill cipher, the Book cipher and versions of the Enigma and Fialka cipher machines have all been used. The 2009 challenge ended with a Jefferson Disk cipher, the 2012 challenge ended with the ADFGVX Cipher, the 2014 with the Playfair Cipher, and the 2024 challenge ended with a sectioned Cadenus transposition.

Prizes £25 cash prizes are awarded to eight random entrants who submit a correct solution for each part A of the challenge. Leaderboards for the part B challenges are also compiled, based on how accurate solutions are and how quickly the entrant broke the cipher. Prizes are awarded to the top three entrants at the end of the challenge. In the 2009/10 challenge, the sponsors provided several prizes: IBM provided iPod Touches to each member of the team winning the Team Prize, Trinity College provided a cash prize of £700, and GCHQ provided a cash prize of £1000. In previous years prizes such as an IBM Thinkpad laptop have been awarded. After the challenge the winners of the top prizes and other randomly selected entrants are invited to a day held at Bletchley Park consisting of lectures (with subjects such as the Semantic Web, World War II cryptography and computer programming) and the prize-giving ceremony. Guests such as Rob Eastaway have been invited in the past. Current sponsors of the competition include GCHQ, IBM, British Computer Society, Trinity College, Cambridge, Cambridge University Press, Winton Capital Management and EPSRC.

References

External links The official challenge website The website of the 2016/17 challenge (slightly broken) The website of the 2015/16 challenge The websites for the challenges earlier than this are no longer available.

Worked examples

Example 1 — a first encounter with National Cipher Challenge

Start with the simplest possible case. Write down what National Cipher Challenge claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to National Cipher Challenge before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about National Cipher Challenge ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of National Cipher Challenge

In research
National Cipher Challenge appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses National Cipher Challenge in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
National Cipher Challenge is common in secondary-school and first-year university syllabi. It links to neighbouring topics Computer security in the United Kingdom, Cryptography contests, Mathematics education in the United Kingdom, so understanding it makes those chapters shorter.
In everyday life
Look for National Cipher Challenge outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study National Cipher Challenge in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what National Cipher Challenge means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain National Cipher Challenge out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is National Cipher Challenge in simple terms?

The National Cipher Challenge is an annual cryptographic competition organised by the University of Southampton School of Mathematics. Competitors attempt to break cryptograms published on the competition website.

Why does National Cipher Challenge matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study National Cipher Challenge?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on National Cipher Challenge.

Tags

  • Computer security in the United Kingdom
  • Cryptography contests
  • Mathematics education in the United Kingdom
  • Secondary schools in the United Kingdom
  • University of Southampton

Keep exploring