Algorytm RSA - Matematyka Kryptografii

In this video, I thoroughly discuss the mathematics behind the cryptography currently used online. In the video, you'll find: 00:00 - What's in the episode? 01:32 - A simple idea for a symmetric cipher 03:09 - The idea of an asymmetric cipher 04:35 - Large prime numbers 07:30 - RSA 09:43 - Rings 13:32 - The clock trick 15:37 - The remainder of modulo division 17:18 - Modulo operations 20:25 - Fermat's Little Theorem and Euler's Theorem 22:21 - The heart of RSA 24:32 - The RSA algorithm 26:48 - A special case 28:46 - RSA - an example 31:29 - The Extended Euclidean Algorithm 34:45 - Fast modular exponentiation 39:10 - Computation time for a computer 41:40 - The Miller-Rabin probability test 44:08 - RSA with random packaging 46:34 - Number Systems 48:14 - RSA with Random Packing (continued) 51:35 - RSA Attacks and Weaknesses 55:00 - Hybrid Encryption :)