1 / 41

Cryptography in World War II: British Cipher Machine, Typex Machine, and German Code-Breaking Efforts

This article explores the role of cryptography in World War II, including the British Cipher Machine, Typex Machine, and German code-breaking efforts. It also discusses modern symmetric ciphers and the concept of asymmetric cryptosystems.

rchasteen
Download Presentation

Cryptography in World War II: British Cipher Machine, Typex Machine, and German Code-Breaking Efforts

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Cryptography in World War II Jefferson Institute for Lifelong Learning at UVa Spring 2006David Evans Class 4: Modern Cryptography http://www.cs.virginia.edu/jillcrypto

  2. Menu • Some loose ends on WWII • Maurice Burnett • Modern Cryptography • Modern symmetric ciphers • Public-key cryptosystems

  3. British Cipher Machine • Design based on commercial Enigma • 5 rotor wheels (instead of 3 in Enigma) • Multiple rings per rotor • Last 2 rotor wheels didn’t rotate • British attempted to break it (without success) Typex Machine

  4. German Code-Breaking Efforts • About 6,000 people (compare to 12,000 working at Bletchley Park) • Decentralized: each military branch had their own, didn’t share what they learned • Effective against manual codes: broke about 50% of manually coded messages • Didn’t attempt to break rotor-based ciphers – so confident Enigma was unbreakable, didn’t try to Typex and similar machines

  5. Lorenz Cipher From http://www.codesandciphers.org.uk/lorenz/fish.htm

  6. Modern Symmetric Ciphers A billion billion is a large number, but it's not that large a number. Whitfield Diffie • Same idea but: • Use digital logic instead of mechanical rotors • Larger keys (random bits, not rotor alignments) • Lorenz  512 < 109 • Modern  128 bits > 1037 • Encrypt blocks of letters at a time

  7. Modern Ciphers • AES (Rijndael) successor to DES selected 2001 • 128-bit keys, encrypt 128-bit blocks • Brute force attack (around 1030 times harder than Lorenz) • Try 1 Trillion keys per second • Would take 10790283070806000000 years to try all keys! • If that’s not enough, can use 256-bit key • No known techniques that do better than brute force search

  8. Eve Login Process Terminal Login: alyssa Password: fido Trusted Subsystem login sends <“alyssa”, “fido”>

  9. Sending Passwords Encrypt The Internet User Server

  10. The Internet Ciphertext Encrypt Decrypt Plaintext Plaintext K K User C = EncryptK (P) P = DecryptK (C) Server

  11. Key Agreement Demo (Animated version at end of slides.)

  12. Asymmetric Cryptosystems • Need a hard problem (like symmetric cryptosystems) • With a trap door: if you know a secret, the hard problem becomes easy

  13. One-Way Functions • Easy to compute, hard to invert • Trap-door one way function: • D (E (M)) = M • E and D are easy to compute. • Revealing E doesn’t reveal an easy way to compute D. • Hence, anyone who knows E can encrypt, but only someone who knows D can decrypt

  14. RSA [Rivest, Shamir, Adelman 78] One-way function: multiplication is easy, factoring is hard Trap-door: number theory (Euler and Fermat)

  15. Security of RSA • n is public, but not p and q where n = pq • How much work is factoring n? Number Field Sieve (fastest known factoring algorithm) is: O(e1.9223((ln (n))1/3 (ln (ln (n)))2/3) n ~200 digits – would take quintillions of years

  16. Asymmetric Cryptosystems • Encryption and Decryption are done with different keys • Keep one of the keys secret, reveal the other EKRA (EKUA (M)) = M Alice’s Public Key: KUA Alice’s Private Key: KRA Only KRA can decrypt a message encrypted using KUA.

  17. Public-Key Applications: Privacy Bob Alice • Alice encrypts message to Bob using Bob’s Public Key • Only Bob knows Bob’s Private Key only Bob can decrypt message Decrypt Ciphertext Encrypt Plaintext Plaintext Bob’s Public Key Bob’s Private Key

  18. Signatures Bob Alice Signed Message Decrypt Encrypt • Bob knows it was from Alice, since only Alice knows Alice’s Private Key • Non-repudiation: Alice can’t deny signing message (except by claiming her key was stolen!) • Integrity: Bob can’t change message (doesn’t know Alice’s Private Key) Plaintext Plaintext Alice’s Public Key Alice’s Private Key

  19. The Internet Ciphertext Encrypt Decrypt Plaintext Plaintext KUS KRS User Server Public Key Private Key How does User know the public key to use?

  20. Key Management

  21. Approach 1: Meet Secretly • User and Server Operator meet secretly and swap public keys • If you can do that, might as well agree on a secret (symmetric key) instead • Doesn’t work for Internet transactions

  22. Approach 2: Public Announcement • Publish public keys in a public forum • Append to email messages • Post on web site • New York Time classifieds • Easy for rogue to pretend to be someone else • Forge email, alter web site, lie to New York Times

  23. Approach 3: Public Directory • Trusted authority maintains directory mapping names to public keys • Entities register public keys with authority in some secure way • Authority publishes directory • Print using watermarked paper, special fonts, etc. • Allow secure electronic access • Depends on secure distribution of directory’s key

  24. KUS CS = EKRVeriSign[“Server”, KUS] Request CS Approach 4: Certificates VeriSign $$$$ User Server EKUVeriSign (CS) = [“Server”, KUS] Knows KRS

  25. KRCA[Server Identity, KUS] KUS[K] Secure channel using K SSL (Secure Sockets Layer) Server Browser Hello Check Certificate using KUCA Pick random K Find K using KRS Note: This is slightly simplified from the actual SSL protocol. This version is vulnerable to a person-in-the-middle attack!

  26. Data encrypted using secret key exchanged using some public key associated with some certificate.

  27. KRCA[Server Identity, KUS] KUS[K] Secure channel using K SSL Recap Server Browser Hello Check Certificate using KUCA Pick random K Find K using KRS Note: This is slightly simplified from the actual SSL protocol. This version is vulnerable to a person-in-the-middle attack!

  28. Questions?

  29. Animated version of Asymmetric Cryptography Demo

  30. Padlocked Boxes Hi! Alice

  31. Alice’s Padlock Alice’s Padlock Key Padlocked Boxes Hi! Alice

  32. Shady Sammy’s Slimy Shipping Service Padlocked Boxes Alice Alice’s Padlock Key

  33. Bob’s Padlock Bob’s Padlock Key Padlocked Boxes Alice Hi! Bob Alice’s Padlock Key

  34. Bob’s Padlock Key Padlocked Boxes Hi! Alice Bob Alice’s Padlock Key

  35. Bob’s Padlock Key Padlocked Boxes Hi! Alice Bob Alice’s Padlock Key

  36. Padlocked Boxes Alice Hi! Bob Bob’s Padlock Key

  37. Padlocked Boxes Hi! Alice Hi! Bob Bob’s Padlock Key

More Related