If you're seeing this message, it means we're having trouble loading external resources for Khan Academy. <\/p>\n
If you're behind a web filter, please make sure that the domains *.kastatic.org and *.kasandbox.org are unblocked. <\/p>\n
To log in and use all the features of Khan Academy, please enable JavaScript in your browser. <\/p>\n
Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). <\/p>\n
We've partnered with Dartmouth college professors Tom Cormen and Devin Balkcom to teach introductory computer science algorithms, including searching, sorting, recursion, and graph theory. Learn with a combination of articles, visualizations, quizzes, and coding challenges. <\/p>\n
How have humans protected their secret messages through history? What has changed today? <\/p>\n
We've always been communicating.... as we moved from signal fires, to alphabets & electricity the problems remained the same. <\/p>\n
How have humans protected their secret messages through history? What has changed today? <\/p>\n
Explore how we have hidden secret messages through history. <\/p>\n
Assess your understanding of the code breaking presented in the ancient cryptography lesson. This series of articles and exercises will prepare you for the upcoming challenge! <\/p>\n
A new problem emerges in the 20th century. What happens if Alice and Bob can never meet to share a key in the first place? <\/p>\n
Ready to try your hand at real-world code breaking? This adventure contains a beginner, intermediate and super-advanced level. See how far you can go! <\/p>\n
This is a system of arithmetic for integers. These lessons provide a foundation for the mathematics presented in the Modern Cryptography tutorial. <\/p>\n
Why do primes make some problems fundamentally hard? To find out we need to explore primality tests in more detail. <\/p>\n
Would access to coin flips speed up a primality test? How would this work? <\/p>\n<\/p>\n
<\/p>\n