Public key cryptography, also called asymmetric cryptography, uses a mathematically related pair of keys, a public key that can be shared freely and a private key kept secret, so that data protected with one key can only be reversed with the other. This solves the hardest problem in classical cryptography: exchanging secrets over an untrusted channel. It underpins TLS, digital signatures, secure messaging, and code signing. Because asymmetric operations are slow, real systems combine it with fast symmetric encryption in a hybrid design.
Key takeaways
- Asymmetric cryptography uses a linked key pair: a shareable public key and a secret private key.
- Encrypt with the recipient’s public key so only their private key can decrypt; sign with your private key so anyone can verify with your public key.
- It solves key distribution, letting parties communicate securely without a pre-shared secret.
- It is far slower than symmetric encryption, so systems use it to establish a symmetric session key and encrypt bulk data symmetrically.
- Digital signatures provide integrity, authenticity, and non-repudiation.
- Trust in a public key depends on certificates and certificate authorities, not on the key material alone.
What is the core idea behind public key cryptography?
The breakthrough is that the two keys perform inverse operations and cannot be feasibly derived from each other. You can publish your public key to the world, and anyone can use it to encrypt a message that only your private key can decrypt. Conversely, you can sign data with your private key so that anyone with your public key can verify it came from you.
The security rests on mathematical problems that are easy in one direction and infeasible to reverse without the private key, such as factoring large numbers or computing discrete logarithms on elliptic curves. As long as the private key stays secret and the key size is adequate, an attacker holding the public key cannot recover the private key.
How is asymmetric different from symmetric encryption?
Symmetric encryption uses a single shared key for both encryption and decryption. It is fast and ideal for bulk data, but it forces both parties to somehow share that key securely in advance. Asymmetric encryption removes that requirement at the cost of speed.
| Property | Symmetric | Asymmetric |
|---|---|---|
| Keys | One shared secret | Public and private pair |
| Speed | Fast | Much slower |
| Key distribution | Hard, needs secure channel | Easy, publish the public key |
| Best for | Encrypting bulk data | Key exchange and signatures |
The practical answer is to use both. Asymmetric cryptography securely establishes or transports a symmetric key, and then the fast symmetric cipher encrypts the actual payload. This hybrid model gives you both easy key distribution and high throughput.
How does encryption with a key pair actually work?
To send a confidential message, you use the recipient’s public key. Because only the recipient holds the matching private key, only they can decrypt it. The direction matters: encryption uses the recipient’s public key, decryption uses the recipient’s private key.
- The recipient publishes their public key.
- The sender encrypts the message with that public key.
- The ciphertext travels over an untrusted channel.
- The recipient decrypts with their private key.
A common mistake is to think the same key both encrypts and decrypts here; it does not. Also, because asymmetric encryption is slow and size-limited, in practice you rarely encrypt a large message directly. Instead you encrypt a randomly generated symmetric key with the public key and encrypt the message body with that symmetric key.
What is a digital signature and how does it differ from encryption?
A digital signature flips the key usage to provide authenticity and integrity rather than confidentiality. You sign with your private key, and anyone can verify with your public key. This proves the message came from you and was not altered.
The process signs a hash of the message rather than the whole message for efficiency:
- Compute a cryptographic hash of the message.
- Sign the hash with your private key to produce the signature.
- The verifier hashes the received message independently.
- The verifier checks the signature against that hash using your public key.
If the signature verifies, the message is intact and authentic. Signatures give three properties: integrity (the content was not changed), authenticity (it came from the key holder), and non-repudiation (the signer cannot plausibly deny it). Note the reversed direction compared to encryption: signing uses the private key, verifying uses the public key.
How does TLS use public key cryptography?
When your browser connects to a site over HTTPS, TLS uses asymmetric cryptography for two jobs: authenticating the server and establishing a shared secret. The server presents a certificate containing its public key and signed by a certificate authority. The client verifies that signature to trust the key belongs to the server.
The handshake then performs a key exchange, commonly using ephemeral Diffie-Hellman, to agree on a symmetric session key that neither party transmits directly. From that point, all application data is encrypted with the fast symmetric key. Ephemeral key exchange also provides forward secrecy, meaning that compromising the server’s long-term private key later does not decrypt previously recorded sessions.
How do certificates and trust actually work?
A public key by itself proves nothing about who owns it. An attacker could hand you their key and claim to be your bank. Certificates and certificate authorities (CAs) solve this trust problem. A certificate binds a public key to an identity and is signed by a CA that your system already trusts.
- A CA verifies an entity’s identity and issues a signed certificate for its public key.
- Your operating system or browser ships with a set of trusted root CAs.
- Certificates chain from a leaf up to a trusted root, and each link is verified.
- Certificates expire and can be revoked, so validation includes checking status.
This is why a self-signed certificate triggers a warning: nothing in your trust store vouches for it. The chain of trust is what turns raw public keys into verifiable identity.
What are common pitfalls with public key cryptography?
Most failures come from misuse rather than broken math:
- Leaking the private key: the entire scheme collapses if the private key is exposed, so store it with strong access controls and consider hardware protection.
- Rolling your own crypto: use vetted libraries and standard algorithms rather than custom implementations.
- Skipping certificate validation: disabling hostname or chain verification to silence errors reopens man-in-the-middle attacks.
- Confusing key directions: encrypting with your own public key or signing with a public key indicates a design error.
- Using weak key sizes or deprecated algorithms: follow current recommendations and plan for algorithm agility.
- Encrypting bulk data directly: use the hybrid approach with a symmetric session key instead.
Treat key management, not the algorithm itself, as the hard part. Generation, storage, rotation, and revocation of keys determine real-world security far more than the choice of cipher.
Where is public key cryptography used in everyday software?
Even developers who never call a crypto library directly rely on asymmetric cryptography constantly, because it underpins the trust layer of modern systems. Recognizing these touchpoints helps you reason about where keys live and what a compromise would mean.
- HTTPS and TLS: every secure web request authenticates the server and negotiates a session key using public key cryptography.
- SSH: key-based login uses a private key on your machine and a public key on the server, replacing passwords.
- Code and package signing: software updates and packages are signed so clients can verify they came from the real publisher and were not tampered with.
- Tokens and assertions: signed tokens used in authentication are verified with a public key so services can trust them without contacting the issuer.
- Encrypted messaging and email: messages are encrypted to a recipient’s public key and signed with the sender’s private key.
In each case the same two primitives appear: encrypt to a public key for confidentiality, and sign with a private key for authenticity. Knowing which direction a given system uses tells you immediately which key must stay secret and what an attacker would gain by stealing it.
Frequently asked questions
What is public key cryptography in simple terms?
It uses a mathematically linked key pair: a public key anyone can hold and a private key kept secret, so you can encrypt or verify with one and decrypt or sign with the other.
What is the difference between symmetric and asymmetric encryption?
Symmetric encryption uses one shared secret key for both operations, while asymmetric encryption uses a public and private key pair, trading speed for easier key distribution.
Can you decrypt with a public key?
In encryption you encrypt with the recipient’s public key and only the matching private key can decrypt. Public keys verify signatures but do not decrypt confidential messages meant for the private key holder.
What is a digital signature?
A digital signature is created with a private key over a message hash and verified with the corresponding public key, proving integrity and authenticity.
Is public key cryptography slower than symmetric?
Yes, asymmetric operations are much slower, which is why systems use it to exchange or protect a symmetric key and then encrypt bulk data symmetrically.
How does TLS use public key cryptography?
TLS uses asymmetric cryptography to authenticate the server via its certificate and to establish a shared symmetric session key, then encrypts traffic symmetrically.
What is a certificate authority?
A certificate authority is a trusted party that signs certificates binding a public key to an identity, so clients can trust that a public key belongs to who it claims.