Any book on cryptography written for a more-or-less lay audience must inevitably face comparisons to The Code Book, written in 1999 by Simon Singh, the king of distilling complex subjects to a few hundred pages of understandable writing. While Singh’s book is a pretty thorough history of codes and codebreaking through the centuries with plenty of the maths thrown in, The Mathematics of Secrets is tilted (and indeed titled) more towards a fuller explanation of the mathematical techniques underlying the various ciphers. Although Holden’s book follows a basically chronological path, you won’t find too much interest in pre-computer ciphers here: Enigma is cracked on page seventy, and the name Alan Turing does not appear in the book.
Next week, the British Science Festival will take place in Swansea, in and around the University. Here’s our round-up of all the mathsiest of the maths events taking place during the week. Our own Katie Steckles will be there introducing most of these events, so you might spot her at the front telling you what to do if there’s a fire. You’ll need to register to book tickets, but all the events are free.
Robert Hannigan, the Director of British intelligence agency GCHQ, gave a speech at MIT recently on the currently contentious issue of backdoors into encryption.
To accompany his speech, and maybe to reaffirm GCHQ’s credentials on the subject, he published two papers written by James Ellis in 1970 about what would become public key encryption: “The Possibility of Secure Non-Secret Digital Encryption” and “The Possibility of Secure Non-Secret Analogue Encryption”.
The story famously goes that two decades after Rivest, Shamir and Adleman announced the RSA algorithm for public key cryptography, GCHQ admitted that their employee Clifford Cocks had come up with essentially the same thing four years before, inspired by James Ellis’s papers on the possibility of cryptography without a secret key.
Rober Hannigan’s speech, Front doors and strong locks: encryption, privacy and intelligence gathering in the digital era.
Read the papers: “The Possibility of Secure Non-Secret Digital Encryption” and “The Possibility of Secure Non-Secret Analogue Encryption” by James Ellis.
To celebrate the release of the upcoming Alan Turing biopic The Imitation Game (see our incisive analysis of the film’s trailer by James Grime) the guys at the University of Manchester – who have previously run the hugely successful Alan Turing Cryptography competition – have been asked to run a one-off Imitation Game Cryptography Competition. And they have.
The competition is themed around the (possibly true? Who knows. It’s not like it’s my job to research these things) idea that Alan Turing’s fortune in silver is buried in a secret location somewhere near Bletchley Park, and it’s your job to crack the three coded clues and find out where. Prizes will be in the form of exclusive Imitation Game merchandise donated by the makers of the film, and the competition runs until the 28th of November.
Imitation Game Cryptography Competition
The University of Manchester is holding another cryptography competition (as featured in this news post earlier this week). We spoke to Charles Walkden, one of the competition’s organisers, about the project.
Following on from the huge success that was their inaugural competition earlier this year, mathematicians from the University of Manchester have put together another Cryptography Competition in honour of father of modern everything, Alan Turing.
This time, the competition is open to teams of school children from all over the UK, and comprises a six-chapter story featuring
Alice and Bob Mike and Ellie, who get “caught up in a cryptographic adventure”. Solving all the puzzles and cracking the codes faster than other people gets you on the leader board, and there are prizes for being near the top as well as extra prizes for randomly-selected teams who’ve solved everything. (You know that since it’s a maths department, their randomisation algorithms will be top-notch). It’s also possible to enter as a non-schoolchild, and check your answers on the site, although you won’t be eligible for prizes. The competition is aimed at UK school years 7-11 (age 11-16), although I can confirm it’s dead good fun for anyone interested in cryptography puzzles themed around exciting storylines.
Alan Turing Cryptography Competition 2013
Manchester University press release
Via Nick Higham on Twitter.