This simulation demonstrates how two parties use elliptic curve point addition and scalar multiplication to independently arrive at the same shared secret point, visualizing the geometric line-and-reflection construction behind point addition and the double-and-add process behind scalar multiplication.
Choose a small demonstration curve and a base point G, then set private scalars for two parties to watch their public points get computed through repeated doubling and adding. Exchange the public points and multiply each by the other party's scalar to confirm both sides land on the identical shared secret point.
Controls let you select a demonstration curve and base point, set each party's private scalar, step through double-and-add point multiplication, and trigger the exchange to compare both parties' computed shared secret points.
Did you know a 256-bit elliptic curve key is generally considered to offer security roughly comparable to a 3072-bit classical Diffie-Hellman key, meaning elliptic curve cryptography can achieve the same practical protection with keys more than ten times shorter.
This simulation demonstrates how two parties use elliptic curve point addition and scalar multiplication to independently arrive at the same shared secret point, visualizing the geometric line-and-reflection construction behind point addition and the double-and-add process behind scalar multiplication.
This simulation demonstrates how two parties use elliptic curve point addition and scalar multiplication to independently arrive at the same shared secret point, visualizing the geometric line-and-reflection construction behind point addition and the double-and-add process behind scalar multiplication.
Choose a small demonstration curve and a base point G, then set private scalars for two parties to watch their public points get computed through repeated doubling and adding. Exchange the public points and multiply each by the other party's scalar to confirm both sides land on the identical shared secret point.
Did you know a 256-bit elliptic curve key is generally considered to offer security roughly comparable to a 3072-bit classical Diffie-Hellman key, meaning elliptic curve cryptography can achieve the same practical protection with keys more than ten times shorter.