Elliptic curve
Two parties, Alice and Bob, agree on a group formula_1 with generator formula_2 of prime order formula_3 in which the discrete log problem is hard. Typically a Schnorr group is used. In general, J-PAKE can use any prime order group that is suitable for public key cryptography, including Elliptic curve cryptography. Let formula_4 be their shared (low-entropy) secret, which can be a password or a hash of a password (formula_5). The protocol executes in two rounds.