Turing's Enigma Problem (Part 1) - Computerphile

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: http://youtu.be/kj_7Jc1mS9k

Professor Brailsford's notes: http://bit.ly/enigmapart2

158,962,555,217,826,360,000 – Numberphile: http://youtu.be/G2_Q9FoD-oQ
Flaw in the Enigma Code - Numberphile: http://youtu.be/V4V2bpZlqx8
Punch Card Programming: http://youtu.be/KG2M4ttzBnY
Public Key Cryptography: http://youtu.be/GSIDS_lvRv4

http://www.facebook.com/computerphile
https://twitter.com/computer_phile

This video was filmed and edited by Sean Riley.

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

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

Learn more about your ad choices. Visit megaphone.fm/adchoices