Few careers trace the whole arc of modern cryptography as completely as that of Professor Robert Churchhouse CBE. He learned mathematics from the men who mechanised the breaking of the wartime codes, spent more than a decade on ciphers inside Britain’s cryptographic service, helped run one of Europe’s largest computing facilities, and then taught for a quarter of a century, closing with a book that took the reader from the simple substitution ciphers of the classical world to the public-key systems that secure the modern web. We were among his students at Cardiff, taught numerical analysis by him in the early 1990s, and this piece sets down what his career represented, both as a contribution to security and as a thread of continuity in a field that now sits at the centre of everyday life.

The lineage he inherited

Professor Churchhouse was born in Manchester in 1927 and read mathematics at the university there in the years after the war. His teachers included Professor Max Newman FRS and Alan Turing OBE FRS, the two figures most closely associated with the mechanisation of codebreaking at Bletchley Park. From Manchester he went to Trinity Hall, Cambridge, for a doctorate in number theory under L. J. Mordell, one of the leading number theorists of the day. That inheritance matters for what followed. He entered cryptography having been taught by the people who had, a few years earlier, turned the breaking of ciphers from an art into a machine-assisted science.

Eleven years on ciphers

In 1952 he joined the Royal Naval Scientific Service, a forerunner of GCHQ, and spent eleven years on cipher work in London, Cheltenham, and the British embassy in Washington. He worked alongside Hugh Alexander and Jack Good, both Bletchley Park veterans of the Enigma effort. What he did there stayed classified, and Professor Churchhouse kept silent about it for the rest of his life, as the people of that service did. What can be said is that he spent more than a decade at the operational centre of British cryptographic security during the early Cold War, and that the discretion he carried afterwards was itself part of the profession.

From ciphers to computing

In the early 1960s Professor Churchhouse became head of programming at the Atlas Computer Laboratory at Harwell, working on the Atlas machine, then among the most powerful in the world and a national computing service provided free to British universities. That role placed him at the operational edge of computing as well as cryptography, responsible for the software, compilers, and early on-line systems that made the machine usable. In 1971 he left to found the Department of Computing Mathematics at Cardiff University, which he led as its inaugural professor for the next two decades, later serving as President of the Institute of Mathematics and its Applications and being appointed CBE. Few people of his generation held that combination, deep mathematical training, classified cryptographic experience, and the operational running of a major computing facility, and the department he built reflected all three.

The teaching, and the book

We knew him in the last of these roles. He lectured us on the Enigma machine, using an example he had borrowed from former colleagues to show his undergraduates how the rotors and the plugboard turned a keystroke into ciphertext. To be taught the machine by someone who had handled its secrets professionally, and who had been taught in turn by Turing and Newman, was a direct transmission across the central episode of twentieth-century cryptography, though none of us recognised the weight of it at the time.

His lasting public contribution to security is the one he made as an educator. He wrote Codes and Ciphers: Julius Caesar, the Enigma, and the Internet (Churchhouse, 2002), a book that does what its subtitle promises. It begins with the substitution ciphers of the classical world, works through the polyalphabetic systems and the cipher machines of the two world wars, including the Enigma and the Hagelin, and carries the reader forward to public-key cryptography and the encryption that secures the modern internet, with RSA among the systems it explains. Its arc is the point. The book shows that the cryptography protecting a bank transaction today belongs to the same continuous intellectual tradition as the cipher that protected a message in Caesar’s time, and it makes the mathematics of that tradition accessible to a general reader.

Why the continuity matters

What we take from Professor Churchhouse’s career, and what makes it worth setting down, is the continuity it embodies. Cryptography is often presented as a sequence of revolutions: the mechanisation at Bletchley, the public-key breakthroughs of the 1970s, the post-quantum work underway now. His life is a reminder that these are episodes in a single unbroken practice, carried forward by people who learned it from their predecessors and taught it to their successors. The public-key systems that secure the internet rest on the same basic question every cipher has faced, whether the protection can be broken in less effort than it is worth. Names change, from frequency analysis to factorisation to lattice problems, and the question does not.

That continuity is now under fresh pressure. Quantum computing has reopened the question of whether the hard problems underpinning public-key cryptography will stay hard, and standards bodies are already preparing replacements. Professor Churchhouse did not write about that chapter, since it postdates his book, and we will not put words in his mouth about it. What his work gives the present is the longer view, the understanding that today’s cryptographic anxieties are the latest instance of a problem the field has lived with since antiquity, and that the discipline has met each previous instance by learning, adapting, and teaching the next generation what it knew.

He died in 2018. The lineage he carried, from Turing and Newman through his own classroom, reached us casually and undramatically, as these things usually do. We did not recognise where the chain led while we sat in his lectures. We recognise it now, and we set it down here so that others can follow it back.

One of three notes on security and its mathematical foundations, alongside optimisation and cryptography and the open standards that secure the network.