Claude Shannon's Perfect Secrecy

Channel:
Canada Art of the Problem
Subscribers:
190,000
Published on ● Video Link: https://www.youtube.com/watch?v=cAt6MYoGqJ4


Duration: 4:12
82,233 views
382

Claude Shannon's idea of perfect secrecy is introduced. I'd like to get the point across that no amount of computational power can help improve your ability to break a perfectly secrect encryption scheme.



Other Videos By Art of the Problem


2012-09-14What is Information Theory? (Information Entropy)
2012-09-11Computational Number Theory (Prime Adventure part 1)
2012-07-30Public key cryptography - Diffie-Hellman Key Exchange (full version)
2012-07-30Public Key Cryptography: RSA Encryption Algorithm
2012-07-29Gambling with Secrets: 8/8 (RSA Encryption)
2012-07-25Information Theory - Teaser
2012-06-03Gambling with Secrets: Part 7/8 (Diffie-Hellman Key Exchange)
2012-05-07Random vs. Pseudorandom Number Generators
2012-05-04Gambling with Secrets: Part 6/8 (Perfect Secrecy & Pseudorandomness)
2012-04-24The Enigma Machine (how it worked & why it was cracked)
2012-04-17Claude Shannon's Perfect Secrecy
2012-03-12Gambling with Secrets: Part 5/8 (Encryption Machines)
2012-02-24Public Key Cryptography: Diffie-Hellman Key Exchange (short version)
2012-02-14Gambling with Secrets: Part 4/8 (Private Key Cryptography)
2012-01-13Gambling with Secrets: Part 3/8 (Probability Theory & Randomness)
2011-12-12Gambling with Secrets: Part 2/8 (Prime Factorization)
2011-12-12Gambling with Secrets: Part 1/8 (What is Cryptography?)
2011-10-23Art of the Problem.
2011-10-23How Machines Generate Random Numbers with Time
2011-10-17Caesar Cipher - Ancient Cryptography
2011-10-07Teaser Trailer: Gambling with Secrets (pilot episode)


Tags:
perfect secrecy
claude shannon
encryption
random
cryptography