Media Summary: Why is factorization hard, yet generating primes easy? Where do we go How can we improve the speed of a (deterministic) primality test? Watch the Claude Shannon's idea of perfect secrecy: no amount of computational power can help improve your ability
Summary What S Next Journey Into Cryptography Computer Science Khan Academy - Detailed Analysis & Overview
Why is factorization hard, yet generating primes easy? Where do we go How can we improve the speed of a (deterministic) primality test? Watch the Claude Shannon's idea of perfect secrecy: no amount of computational power can help improve your ability Setting up a trapdoor one-way function Watch the Walkthrough of Diffie-Hellman Key Exchange Watch the How can a machine tell us if a number is prime? Watch the
