Asymmetric Cryptography · 3.1

💡 The Public/Private Key Breakthrough

The 1976 idea that made secure internet commerce possible⏱ ~3 min

📮Public key = padlock on your front door; private key = your key

Imagine you want to receive secret messages. You put an unlocked padlock outside your door — anyone can pick it up, snap it shut around their message box, and mail it to you. Only you have the key to open that padlock. You never gave anyone your key, yet they sent you something only you can open. The padlock is your public key. The key to open it is your private key.

Asymmetric encryption: encrypt with the public key, decrypt with the private key

The Revolutionary Idea: Two Mathematically Linked Keys

In 1976, Whitfield Diffie and Martin Hellman published 'New Directions in Cryptography,' introducing the concept of public-key cryptography. The insight: generate two mathematically related keys such that:

•What one key encrypts, only the other key can decrypt
•Knowing the public key makes it computationally infeasible to derive the private key
•The public key can be broadcast to the world without compromising security
•No prior shared secret is needed — two strangers can communicate securely on first contact

Two Modes: Encryption vs Signing

Operation	Who Uses Which Key	Purpose
Encryption	Sender uses recipient's PUBLIC key to encrypt; recipient uses their PRIVATE key to decrypt	Only the recipient can read the message
Digital Signature	Sender uses their own PRIVATE key to sign; anyone uses sender's PUBLIC key to verify	Proves the message came from the sender and wasn't modified

★ FactIn practice, asymmetric encryption is rarely used to encrypt large data directly — it's too slow. Instead, it's used to encrypt a small symmetric key (the 'session key'), which then encrypts the actual data. This hybrid approach is how TLS, PGP, and Signal all work.

The Mathematical Hard Problems

Asymmetric cryptography relies on mathematical problems that are easy to compute one way but computationally infeasible to reverse:

Algorithm	Hard Problem	Easy Direction	Hard Direction
RSA	Integer factorization	Multiply two large primes: p × q = n	Factor n back into p and q
Diffie-Hellman	Discrete logarithm	Compute g^x mod p given g, x, p	Find x given g, g^x mod p, p
ECC	Elliptic curve discrete log	Multiply a point P by integer k: k×P	Find k given P and k×P

🔒 SecurityThese problems are believed to be hard, but not proven to be. If P=NP (one of the Millennium Prize Problems), all of asymmetric cryptography could collapse. In practice, no efficient algorithm has been found for any of these in 50+ years of active research — though Shor's algorithm on a quantum computer would break RSA and DH.

🧠Quick Checkfirst try = +5 XP

To send Bob a secret message, you encrypt with…

🎮 Practice what you learned

🔓

Cipher Cracker

Break Caesar & substitution ciphers yourself

→🏰

Password Fort

See hashing & cracking in action

→

⭐ 0 XP🔥 0 days

Open the full interactive Cryptography module →