RSA encryption works on a genuinely elegant asymmetry — a public key anyone can use to encrypt a message, and a mathematically related but distinct private key needed to decrypt it. This tool provides information about RSA key pairs and how the underlying math actually works.
The algorithm that first made secure communication possible without ever meeting
RSA, named after its inventors Ron Rivest, Adi Shamir and Leonard Adleman, was published in 1977 (though British intelligence agency GCHQ had independently developed similar ideas in secret slightly earlier, only declassified decades later), solving a problem that had genuinely stumped cryptographers for the entire prior history of the field: how can two parties who have never met and share no prior secret establish secure, private communication? RSA's answer was "public-key" cryptography — a public key that anyone can freely use to encrypt a message, paired with a mathematically related private key, known only to the intended recipient, needed to decrypt it — built on the practical difficulty of factoring the product of two very large prime numbers back into its original factors.
How RSA key pairs work, conceptually
An RSA key pair is generated by selecting two very large prime numbers and combining them mathematically to produce both a public key (safe to share with anyone) and a private key (which must be kept absolutely secret) — the security of the entire system rests on the fact that while multiplying two large primes together is computationally fast and easy, factoring that resulting large product back into its original two primes is, for sufficiently large keys, computationally infeasible with current technology, meaning an attacker with only the public key cannot practically derive the corresponding private key.
Where RSA is genuinely used, and why key information matters
- TLS/SSL certificate infrastructure — RSA has historically been one of the standard algorithms underlying the certificate system that secures HTTPS connections, though newer algorithms like elliptic curve cryptography are increasingly used alongside or instead of it for performance reasons.
- SSH key-based authentication — RSA key pairs are commonly used to authenticate secure shell connections to remote servers without needing to transmit a password at all.
- Digital signatures — RSA can be used in reverse of its typical encryption role to create digital signatures, letting a private key holder prove authorship of a document that anyone with the corresponding public key can verify.
- Understanding key length security implications — knowing the relationship between key size and security strength (larger keys are more secure but also computationally slower) matters for choosing appropriate parameters when generating new RSA keys.
Frequently asked questions
Why can the public key be shared freely, but not the private key? Because the mathematical relationship between them is deliberately one-directional in terms of practical computability — deriving the private key from the public key alone requires factoring an enormous number, a problem believed to be computationally infeasible for sufficiently large keys with current classical computing technology, which is exactly the security assumption the entire RSA system rests on.
Is RSA considered vulnerable to future quantum computers? Yes, theoretically — a sufficiently powerful quantum computer running Shor's algorithm (a quantum algorithm specifically designed for efficient factoring) could, in principle, break RSA's underlying security assumption, which is exactly why cryptographers are actively developing and standardizing "post-quantum" cryptographic algorithms intended to remain secure even against future quantum computing capability.
What key length is currently considered secure for RSA? 2048-bit keys are widely considered the current practical minimum for security-critical use, with 3072-bit or 4096-bit keys recommended for longer-term or particularly high-value security needs, reflecting ongoing, gradual increases in computational power and cryptanalytic technique over time.
Further reading
Wikipedia — RSA (cryptosystem) — Full mathematical background and history of RSA public-key cryptography.