Primes in Cryptography

Number Theory · Axiom Academy

REAL WORLD Primes in Cryptography How prime numbers protect every secure website you visit You're Protected by Primes Right Now Every time you see that little padlock icon in your browser's address bar, prime numbers are working behind the scenes to protect your passwords, credit card numbers, and private messages. The most widely used encryption system on the internet is called RSA , and it relies entirely on a simple mathematical fact: multiplying two large prime numbers is easy, but factoring their product back into primes is extremely hard . Let's explore how this simple asymmetry protects billions of people every day. Let's start with a small example to understand the concept: Two Prime Numbers: p = 61 q = 53 Multiply them (EASY): n = 61 × 53 = 3,233 Now try the reverse: Given only n = 3,233, find p and q (Much harder! You'd have to try dividing by many numbers) With small numbers, factoring is still doable. But what happens when we use really big prime numbers? Modern cryptography uses primes that are hundreds of digits long. Let's explore how key size affects security: *Using the best known classical algorithms with current technology Notice the asymmetry: generating primes takes milliseconds , but factoring their product could take millions of years ! Why Is This Useful for Security? Think about what we've learned. If you want to create a secure lock that only you can open, what mathematical operation should you use?

This is the written version of the interactive lesson above. See the full Number Theory course.