- What structural flaw in the Enigma machine did Turing and Welchman exploit to build the Bombe?
- How did the Bombe eliminate impossible key settings rather than searching for the correct one directly?
- Why is the Bombe not considered a computer in the modern sense?
- Why did it take decades for Bletchley Park's codebreaking work to become publicly known?
Cryptography
Techniques for secure communication and encryption.
- What cipher was Colossus built to attack, and how did it differ from the more famous Enigma?
- How did Colossus use vacuum tubes and electronic logic to process paper tape faster than earlier electromechanical machines?
- What role did the Mark 2 Colossus play in confirming German expectations about the D-Day invasion site?
- How did Turing's work on the Enigma cipher during the war affect its duration?
- Where is formal program verification used today in situations where a software bug would be catastrophic?
- What real-world fields, like cryptography, would be affected if someone proved P equals NP?
- How does complexity theory explain why cryptographers trust certain codes to be practically unbreakable?
- How did Manuel Blum help define what it means for an encryption scheme to be secure?
- What is a pseudorandom number generator, and why does modern cryptography depend on it?
- How does RSA encryption use the difficulty of factoring large primes to secure communication?
- Why can a public-key system let you share an encryption key openly without compromising the decryption key?
- Why did the Turing Award for RSA arrive twenty-five years after the original 1977 paper?
- How did Liskov's work on Byzantine fault tolerance shape how large distributed systems handle failure?
- How was cryptographic security judged before Goldwasser and Micali gave it a rigorous mathematical definition?
- What does semantic security mean, and why was it a foundational concept for provable cryptography?
- What is a zero-knowledge proof, and how can one party prove a statement true without revealing why?
- Where do zero-knowledge proofs show up in modern technology like blockchain protocols?
- What is the Byzantine Generals Problem and why does it define the theoretical limits of consensus?
- What problem in cryptography did key exchange pose before 1976?
- How does public-key cryptography let two parties agree on a secret while being observed?
- Why does modular arithmetic make eavesdropping on the exchange computationally intractable?
- What are zero-knowledge proofs, and where are they used in modern cryptography?
- How does the BB84 protocol use quantum mechanics to detect eavesdropping on a transmitted key?
- Why did pre-1984 cryptography rely on computational hardness rather than physical laws for its security guarantees?
- Why was the 2025 Turing Award seen as recognizing a foundation for an entire new computing paradigm rather than a single cryptographic trick?