Loading CryptoViz...
Loading page content...Loading CryptoViz...
Loading page content...Knapsack cryptosystem disguised via discrete logarithms in the field extension GF(p^h) — genuinely more elaborate than Merkle-Hellman's modular-multiplication disguise. FIXED HAMMING WEIGHT constraint on messages. Status: BROKEN (Vaudenay 1998, targeting the GF(p^h) construction — distinct break from Merkle-Hellman's Shamir attack).
Save and restore visualizer settings in this browser.
Imported traces are validated and replayed locally. They never run a cipher operation automatically.
Continue your cryptography learning path
An asymmetric cipher based on the difficulty of factoring large semiprimes. Supports key generation, encryption, and decryption.
The finite-field discrete-log ancestor of ECDSA (NIST FIPS 186, 1994) — same r/s signature equation, computed in a prime-order subgroup instead of on a curve. Demo uses toy parameters; real DSA needs p>=2048 bits, q>=224 bits.
A key exchange protocol enabling two parties to establish a shared secret over an insecure channel.
Related Resources