[Pairing Home][Home]
Elliptic curves are used fairly extensively in public key encryption (such as in Bitcoin and Tor). A BN-curve (Barreto-Naehrig curve) defines an elliptic curve which can be used for pairings that allow for a high security and efficiency level. This page implements the tripartite Diffie-Hellman algorithm and where Bob, Alice and Carol can share a secret key. In this case we will not be using crypto pairing, but have two rounds of exchange. In this case we have a curve (G1) and a generator point (G), and Bob, Alice and Carol determine their private key value (\(a\), \(b\) and \(c\)). Next they exchange their public key values of \(aG\), \(bG\) and \(cG\), and go through two rounds of exchange, to eventually end up with \(abcG\).