Meet-in-the-Middle Attack Simulator

Double encryption C = E_k2(E_k1(P)) looks like it should need 2^112 work to break — but an attacker with one known plaintext/ciphertext pair can build a lookup table from one direction and search from the other, meeting in the middle for roughly 2×2^n work instead of 2^(2n). This is exactly why 3DES uses three keys, not two. The demo below runs the real algorithm over a reduced keyspace so it finishes in your browser.