Generate RSA public/private key pairs with configurable key sizes (2048, 3072, 4096-bit) in PEM format.
An RSA key pair is two large numbers with a one-way relationship: data signed or encrypted with one half is verified or decrypted with the other. Pick a size (2048, 3072, or 4096 bits) and the page generates a new pair from two large random primes, returning both halves as PEM text ready to save into files. The surprise most users hit: every click produces a brand-new, unrelated pair, and nothing can ever regenerate it. If you close the page before saving the private key, the pair is gone and every system trusting the public half must be given a new key.
The generator picks two large random primes, multiplies them into a shared modulus, and derives a public exponent (conventionally 65537) plus a matching private exponent from those primes. Both PEM blocks encode that same modulus, which is why the two halves work together. Finding primes is probabilistic and the work grows with key size, so a 4096-bit pair takes noticeably longer to produce than a 2048-bit one.
PEM is the plain-text envelope most key-consuming software accepts: a BEGIN label line, the key's binary encoding rendered as base64 text, and a matching END line. The label names the container, such as PUBLIC KEY or RSA PRIVATE KEY. Save the block verbatim, envelope lines included, to a file ending in .pem. The private-key block is the sensitive half - treat it like a password, not a config value.
No. Each run generates from fresh randomness, so the exact same pair cannot be reproduced; the private key exists only where you saved it. If it is lost, generate a new pair and redeploy the public key to every system that trusts the old one - that is the only recovery path.
Modestly. NIST's key-management guidance rates 2048-bit RSA at about 112 bits of security strength and 3072-bit at 128 bits, so 4096 buys a small margin at several times the cost of generation, signing, and encryption. For most deployments 3072-bit is a reasonable ceiling; elliptic-curve keys such as secp256r1 or Ed25519 reach comparable strength with far smaller keys.
The behavioral notes were checked against the browser implementation. Standards and primary references below define the relevant format, formula, or platform behavior.
Generate strong, random passwords with customizable length, character sets, and complexity requirements.
Analyze password strength with entropy scoring, crack-time estimates, and improvement suggestions.
Create cryptographically random strings for API keys, tokens, salts, and unique identifiers.
Create QR codes for URLs, text, Wi-Fi credentials, vCards, and more with customizable size and colors.
Scan and decode QR codes from uploaded images or your device camera to extract embedded data.
Compute MD5, SHA-1, SHA-256, and SHA-512 checksums to verify file integrity and detect tampering.