Type any text below and see MD5, SHA-256, and SHA-512 output simultaneously. Notice how output length doubles between each algorithm.
Input TextAsymmetric encryption uses a Public Key to encrypt and a Private Key to decrypt. Unlike AES, you don't share the same secret — you only share the Public Key.
HMAC uses a Secret Key combined with a message to create a unique fingerprint. Unlike a standard hash, only someone with the secret key can verify the authenticity. This is how webhooks and APIs prevent data tampering.
Message Payload (Data to Authenticate) Shared Secret KeyHide encrypted data inside the pixels of an image. We use the Least Significant Bit of the Red, Green, and Blue channels. The visual difference is so small it is undetectable by the human eye.
This simulation demonstrates why MD5 is broken for password storage. A Web Worker runs a dictionary attack against an MD5 hash using 2000 common passwords — and the UI stays fully responsive because all computation happens off the main thread.
Select Target PasswordElliptic Curve Digital Signature Algorithm. Generates a key pair to sign messages. A tiny change in the message will invalidate the signature.
Paste a PEM encoded certificate to extract its ASN.1/DER metadata (Issuer, Subject, Validity, Public Key).
Calculates the information density (randomness) of a string. High entropy is harder to guess or brute-force.
Demonstrates hash collisions on truncated SHA-256 hashes using a Web Worker. As the pool of hashes grows, the probability of a collision approaches 100%.
Elliptic Curve Diffie-Hellman allows two parties to establish a shared secret over an insecure channel. No server is used here. Send your public key link to a friend, or scan the QR code to connect.
Run an intensive 10,000-hash iteration on your local CPU to compare the operational speed of modern hash algorithms. (UI might stutter slightly during execution)