Workspace
Shamir's Secret Sharing
Shamir's Secret Sharing
A threshold scheme (1979): splits a secret into N shares such that any K reconstruct it, but K-1 reveal nothing. Uses GF(256) polynomial arithmetic — a different mathematical toolkit from every other module here.
Workspace Presets
Save and restore visualizer settings in this browser.
Imported traces are validated and replayed locally. They never run a cipher operation automatically.
Recommended Next Step
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