Error occured ! We are notified and will try and resolve this as soon as possible. WARNING! [2] file_put_contents(/home/gelembjuk/domains/myeducationpath.com/app/../html/cache/memory/course_6512_0_e086762d743c0218beb85ea6e1b456cae.txt): Failed to open stream: No such file or directory . Line 75 in file /home/gelembjuk/domains/myeducationpath.com/html/include/class.cache.php. Continue execution. 711466; index.php; 3.15.10.139; GET; url=courses/6512/applied-math-journey-into-cryptography.htm&; ; Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com); ; Executon time: 0
MyEducationPath.com :: Khan Academy : Applied math: Journey into Cryptography
How have humans protected their secret messages through history? What has changed today?. What is Cryptography?. Probability Space. The Caesar Cipher. Caesar Cipher Exploration. Frequency Fingerprint Exploration . Polyalphabetic Cipher. Polyalphabetic Exploration. The One-Time Pad. Perfect Secrecy Exploration. Frequency Stability. Coin flip sequences. Frequency Stability Exploration. The Enigma Encryption Machine (case study). Perfect Secrecy. Pseudorandom Number Generators. Random Walk Exploration. Ciphers vs. Codes. Shift Cipher. Caesar cipher encryption. Caesar Cipher Decryption. Caesar cipher frequency analysis. Vigenere cipher encryption. XOR Bitwise Operation. XOR & the One-Time Pad. XOR Exploration. Bitwise Operators. What's Next?. The Fundamental Theorem of Arithmetic. Public Key Cryptography: what is it?. The Discrete Logarithm Problem. Diffie-Hellman Key Exchange. RSA Encryption: step 1. RSA Encryption: step 2. RSA Encryption: step 3. Time Complexity (Exploration). Euler's Totient Function. Euler Totient Exploration. RSA Encryption: step 4. What should we learn next?. What is Modular Arithmetic?. Modulo Operator. Congruence Modulo. Congruence Relation. Equivalence Relations. The Quotient Remainder Theorem. Modular Addition & Subtraction. Modular Addition. Modular Multiplication. Modular Multiplication. Modular Exponentiation. Fast Modular Exponentiation. Fast Modular Exponentiation. Modular Inverses. Introduction. Primality Test Challenge. Trial Division. Level 1: Primality Test. Running Time. Level 2: measuring running time. Computer Memory (space). Binary Memory Exploration. Algorithmic Efficiency. Level 3: Challenge. Sieve of Eratosthenes. Level 4: Sieve of Eratosthenes. Primality Test with Sieve. Level 5: Trial division using sieve. The Prime Number Theorem. Prime density spiral. Prime Gaps. Time Space Tradeoff. Summary (what's next?). Randomized Algorithms (intro). Conditional Probability (Bayes Theorem) Visualized. Guess the coin. Random Primality Test (warm up). Level 9: Trial Divison vs Random Division. Fermat's Little Theorem. Fermat Primality Test. Level 10: Fermat Primality Test. What's Next?. What is Cryptography?. Probability Space. The Caesar Cipher. Caesar Cipher Exploration. Frequency Fingerprint Exploration . Polyalphabetic Cipher. Polyalphabetic Exploration. The One-Time Pad. Perfect Secrecy Exploration. Frequency Stability. Coin flip sequences. Frequency Stability Exploration. The Enigma Encryption Machine (case study). Perfect Secrecy. Pseudorandom Number Generators. Random Walk Exploration. Ciphers vs. Codes. Shift Cipher. Caesar cipher encryption. Caesar Cipher Decryption. Caesar cipher frequency analysis. Vigenere cipher encryption. XOR Bitwise Operation. XOR & the One-Time Pad. XOR Exploration. Bitwise Operators. What's Next?. The Fundamental Theorem of Arithmetic. Public Key Cryptography: what is it?. The Discrete Logarithm Problem. Diffie-Hellman Key Exchange. RSA Encryption: step 1. RSA Encryption: step 2. RSA Encryption: step 3. Time Complexity (Exploration). Euler's Totient Function. Euler Totient Exploration. RSA Encryption: step 4. What should we learn next?. What is Modular Arithmetic?. Modulo Operator. Congruence Modulo. Congruence Relation. Equivalence Relations. The Quotient Remainder Theorem. Modular Addition & Subtraction. Modular Addition. Modular Multiplication. Modular Multiplication. Modular Exponentiation. Fast Modular Exponentiation. Fast Modular Exponentiation. Modular Inverses. Introduction. Primality Test Challenge. Trial Division. Level 1: Primality Test. Running Time. Level 2: measuring running time. Computer Memory (space). Binary Memory Exploration. Algorithmic Efficiency. Level 3: Challenge. Sieve of Eratosthenes. Level 4: Sieve of Eratosthenes. Primality Test with Sieve. Level 5: Trial division using sieve. The Prime Number Theorem. Prime density spiral. Prime Gaps. Time Space Tradeoff. Summary (what's next?). Randomized Algorithms (intro). Conditional Probability (Bayes Theorem) Visualized. Guess the coin. Random Primality Test (warm up). Level 9: Trial Divison vs Random Division. Fermat's Little Theorem. Fermat Primality Test. Level 10: Fermat Primality Test. What's Next?.
No Paths inclusing the course. You can build and share a path with this course included.
Certification Exams
-- there are no exams to get certification after this course --
If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory.
Use the filter to find a course from courses directory to suggest it as alternative.
Or click "Suggest a course not listed on this site" to add a courses not listed on this site.
Use the filter to find a course from courses directory to suggest it as prerequisite.
Or click "Suggest a course not listed on this site" to add a courses not listed on this site.
Your comments help other users of this web service to choose the best course for them. If you did this course then, please, chare your experience. Write your recomendations to future students of the course
Your review can help future students of the course to understand if this is what they need.
One of the mission of this service is to help to find next course for interested persons. There are many courses for similar subject available online. We want to categorize such corses and map alternatives. But this is not possible to do this manually. We ask you to hwlp us with this. If you know that there are alternatives to this course in the courses directory, then, please, find this alternative and suggest it. This will help many people to find best course for them
Online courses providers usually don't provide clear list of prerequisites to an online course.
And even if provider then recommend only other own courses as prerequisites.
We would like to build relationships withing courses from different providers to understand what courses are prerequisites for a course.
You can help us with this. Suggest courses from the courses directory that are prerequsites to this course.
Your suggestion can help many people to learn more effectively.
You can connect the courses to one or more of your exams in the Exams Directory.
Connect this course to an exam only if your exam can do certification of those who completed the course.
If you are a student of this course or already completed the course you can add it to your education passport. An education passport helps to build and share your education history..
Read more about education passport
If you are interested in learning this course you can add it to your personal education path scheduler. My Path tool helps to build and share your education plan.
Read more about education path
Let us know when you did the course Applied math: Journey into Cryptography.
Add the course Applied math: Journey into Cryptography to My Personal Education Path.
Select what exam to connect to the course.
The course will be displayed on the exam page in the list of courses supported for certification with the exam.
Request for more information
Fill the form below, the course provider will get notification with your details and will contact you.
Your contact request was posted successfully. The course provider will contact you soon.
Angie Ng
Illya Somov
Viacheslav Boichenko
0
0
