ArticleslgStudy

computer science

Heath Robinson (codebreaking machine)

Heath Robinson (codebreaking machine) 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 Heath Robinson (codebreaking machine) rather than just read about it. In short: Heath Robinson was a machine used by British codebreakers at the Government Code and Cypher School at Bletchley Park during World War II in cryptanalysis of the Lorenz cipher. This achieved the decryption of messages in the German teleprinter cipher produced by the Lorenz SZ40/42 in-line cipher machine.

Heath Robinson (codebreaking machine) — main illustration
Heath Robinson (codebreaking machine) — illustration

Key takeaways

  • Heath Robinson (codebreaking machine) 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 Heath Robinson (codebreaking machine) to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Heath Robinson (codebreaking machine) from memory before moving on to harder problems.

Reference excerpt

Heath Robinson was a machine used by British codebreakers at the Government Code and Cypher School at Bletchley Park during World War II in cryptanalysis of the Lorenz cipher. This achieved the decryption of messages in the German teleprinter cipher produced by the Lorenz SZ40/42 in-line cipher machine. Both the cipher and the machines were called "Tunny" by the codebreakers, who named different German teleprinter ciphers after fish. It was mainly an electro-mechanical machine, containing no more than a couple of dozen valves (vacuum tubes), and was the predecessor to the electronic Colossus computer. It was dubbed "Heath Robinson" by the Wrens who operated it, after cartoonist William Heath Robinson, who drew immensely complicated mechanical devices for simple tasks, similar to (and somewhat predating) Rube Goldberg in the U.S. The functional specification of the machine was produced by Max Newman. The main engineering design was the work of Frank Morrell at the Post Office Research Station at Dollis Hill in North London, with his colleague Tommy Flowers designing the "Combining Unit". Dr C. E. Wynn-Williams from the Telecommunications Research Establishment at Malvern produced the high-speed electronic valve and relay counters. Construction started in January 1943, the prototype machine was delivered to Bletchley Park in June and was first used to help read current encrypted traffic soon afterwards. As the Robinson was a bit slow and unreliable, it was later replaced by the Colossus computer for many purposes, including the methods used against the twelve-rotor Lorenz SZ42 on-line teleprinter cipher machine (code named Tunny, for tunafish).

Tutte's statistical method The basis of the method that the Heath Robinson machine implemented was Bill Tutte's "1+2 technique". This involved examining the first two of the five impulses of the characters of the message on the ciphertext tape and combining them with the first two impulses of part of the key as generated by the χ {\displaystyle \chi } wheels of the Lorenz machine. This involved reading two long loops of paper tape, one containing the ciphertext and the other the χ {\displaystyle \chi } component of the key. By making the key tape one character longer than the message tape, each of the 1271 starting position of the χ {\displaystyle \chi } 1 χ {\displaystyle \chi } 2 sequence was tried against the message. A count was amassed for each start position and, if it exceeded a pre-defined "set total", was printed out. The highest count was the most likely one to be the one with the correct values of χ {\displaystyle \chi } 1 and χ {\displaystyle \chi } 2. With these values, settings of the other χ {\displaystyle \chi } wheels could be tried to break all five χ {\displaystyle \chi } wheel starting positions for this message. This then allowed the effect of the χ {\displaystyle \chi } component of the key to be removed and the resulting modified message attacked by manual methods in the Testery.

Tape transport The "bedstead" was a system of pulleys around which two continuous loops of tape were driven in synchrony. Initially this was by means of a pair of sprocket wheels on a common axle. This was changed to drive by friction pulleys with the sprocket wheels maintaining the synchrony when it was found that this caused less damage to the tapes. Speeds of up to 2000 characters per second were achieved for shorter tapes, but only 1000 for longer tapes. The tapes were guided past an array of photo-electric cells where the characters and other signals were read. Possible tape lengths on the bedstead were from 2000 to 11,000 characters.

Tape reading The perforated tapes were read photo-electrically at a "gate" which was placed as near as possible to the sprocket to reduce the effect of stretched tapes. Successive characters on the tape were read by a battery of ten photocells, an eleventh for the sprocket holes and two additional ones for the "stop" and "start" signals that were hand-punched between the third and fourth and fourth and fifth channels.

Combining unit This was designed by Tommy Flowers of the Post Office Research Station at Dollis Hill in North London. It used thermionic valves (vacuum tubes) to implement the logic. This involved the Boolean "exclusive or" (XOR) function in combining the various bit-streams. In the following "truth table", 1 represents "true" and 0 represents "false". (At Bletchley Park these were known as x and • respectively.)

Other names for this function are: "not equal" (NEQ), "modulo 2 addition" (without carry) and "modulo 2 subtraction" (without 'borrow'). Note that modulo 2 addition and subtraction are identical. Some descriptions of Tunny decryption refer to addition and some to differencing, i.e. subtraction, but they mean the same thing. The combining unit implemented the logic of Tutte's statistical method. This required that the paper tape containing the ciphertext was tried against a tape that contained the component of the Lorenz cipher machine generated by the relevant two chi wheels at all possible starting positions. A count was then made of the total number of 0s generated, with a high count indicating a greater probability of the starting position of the chi key sequence being correct.

… excerpt ends here. Continue reading the full article.

Illustrations

Heath Robinson (codebreaking machine): Working replica Heath Robinson machine at The National Museum of Computing on Bletchley Park. On the right is the paper tape transport mechanism that was dubbed the "bedstead" because of a resemblance to an upended metal bed-frame.[1]
Working replica Heath Robinson machine at The National Museum of Computing on Bletchley Park. On the right is the paper tape transport mechanism that was dubbed the "bedstead" because of a resemblance to an upended metal bed-frame.[1]

Worked examples

Example 1 — a first encounter with Heath Robinson (codebreaking machine)

Start with the simplest possible case. Write down what Heath Robinson (codebreaking machine) 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 Heath Robinson (codebreaking machine) 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 Heath Robinson (codebreaking machine) 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 Heath Robinson (codebreaking machine)

In research
Heath Robinson (codebreaking machine) 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 Heath Robinson (codebreaking machine) 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
Heath Robinson (codebreaking machine) is common in secondary-school and first-year university syllabi. It links to neighbouring topics Bletchley Park, Computer-related introductions in 1943, Cryptanalytic devices, so understanding it makes those chapters shorter.
In everyday life
Look for Heath Robinson (codebreaking machine) 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 Heath Robinson (codebreaking machine) in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Heath Robinson (codebreaking machine) 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 Heath Robinson (codebreaking machine) out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Heath Robinson (codebreaking machine) in simple terms?

Heath Robinson was a machine used by British codebreakers at the Government Code and Cypher School at Bletchley Park during World War II in cryptanalysis of the Lorenz cipher. This achieved the decryption of messages in the German teleprinter cipher produced by the Lorenz SZ40/42 in-line cipher mac…

Why does Heath Robinson (codebreaking machine) 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 Heath Robinson (codebreaking machine)?

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 Heath Robinson (codebreaking machine).

Tags

  • Bletchley Park
  • Computer-related introductions in 1943
  • Cryptanalytic devices
  • English inventions
  • World War II military equipment of the United Kingdom

Keep exploring