Turing's Enigma Problem (Part 1) - Computerphile

1,350,125

0 0

Published 2014-11-28

The Enigma cipher machine, said to be unbreakable. Alan Turing had a pivotal role in cracking Enigma codes during WWII. Professor Brailsford takes us through just what Turing and his team were up against.

Engima Part 2:    • Tackling Enigma (Turing's Enigma Prob...

Professor Brailsford's notes: bit.ly/enigmapart2

158,962,555,217,826,360,000 – Numberphile:    • 158,962,555,217,826,360,000 (Enigma M...
Flaw in the Enigma Code - Numberphile:    • Flaw in the Enigma Code - Numberphile
Punch Card Programming:    • Punch Card Programming - Computerphile
Public Key Cryptography:    • Public Key Cryptography - Computerphile

www.facebook.com/computerphile
twitter.com/computer_phile

This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham: bit.ly/nottscomputer

Computerphile is a sister project to Brady Haran's Numberphile. See the full list of Brady's video projects at: bit.ly/bradychannels