Simulate Elliptic Curve Diffie-Hellman key exchange between two parties. Visualize the shared secret derivation process.
Follow an Elliptic Curve Diffie-Hellman exchange from each party's private value to its public key and then to the shared result. The simulator visualizes the two scalar-multiplication paths so you can see why Alice and Bob arrive at the same elliptic-curve value without sending their private values. The calculation runs entirely in the browser, so entered private material is not uploaded. The important surprise is that the displayed shared result is normally an intermediate secret, not a ready-to-use encryption key.
For a curve with base point G, Alice's private scalar a produces public point A = aG, while Bob's private scalar b produces B = bG. Alice combines a with B, and Bob combines b with A. Both paths reach the same point because aB = a(bG) = b(aG) = bA.
The visualization separates values that may be exchanged, such as public keys, from the private scalars that must remain secret. It then shows each participant deriving the common result using one private value and the other participant's public value. Both participants must use compatible curve parameters and valid public keys for the derivations to agree safely.
Alice multiplies Bob's public point bG by her private scalar a, producing abG. Bob multiplies Alice's public point aG by his private scalar b, also producing abG. The private scalars remain different and are never recovered from this equality; only the resulting shared elliptic-curve value matches.
No, not merely because its length appears suitable. Raw ECDH output is generally passed through the key-derivation procedure defined by the surrounding protocol, often with context that binds the resulting keys to the session and their purposes. The simulator illustrates agreement, but its displayed result alone does not define a complete authenticated encryption protocol.
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.