|
Bouncy Castle Cryptography Library 1.85 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.bouncycastle.crypto.agreement.owl.ECSchnorrZKP
Schnorr non-interactive zero-knowledge proof over an elliptic curve, as used in the Owl key exchange. The {(V, r)} pair follows the RFC 8235 ยง3.2 EC-Schnorr-Signature encoding: prover picks ephemeral v in [1, n-1], publishes commitment V = [v]G alongside response r = v - d*c mod n, where d is the prover's private key and c is the challenge hash. The verifier recomputes c and checks V == [r]G + [c]X.
| Constructor Summary | |
ECSchnorrZKP(ECPoint V,
java.math.BigInteger r)
Constructor for ECSchnorrZKP |
|
| Method Summary | |
java.math.BigInteger |
getr()
Get the prover's response r to the challenge c, r = v - d * c mod n where d is the prover's private key |
ECPoint |
getV()
Get the prover's commitment V = G x [v] where G is a base point on the elliptic curve and v is an ephemeral secret |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public ECSchnorrZKP(ECPoint V,
java.math.BigInteger r)
V - Prover's commitment V = G x [v]r - Prover's response r to a challenge c, r = v - d * c mod n| Method Detail |
public ECPoint getV()
public java.math.BigInteger getr()
|
Bouncy Castle Cryptography Library 1.85 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||