bitcoin/bips
1
0
Fork 0
mirror of https://github.com/bitcoin/bips.git synced 2025-05-12 12:03:29 +00:00
Code Issues Releases Wiki Activity

bugfix: respect message m in DLEQ proof generation/verification

Browse Source
This commit is contained in:
Sebastian Falbesoner 2024-12-21 01:01:10 +01:00
parent b838696c97
commit dab5571c37
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
bip-DLEQ/reference.py
View File

@ -25,11 +25,11 @@ def xor_bytes(lhs: bytes, rhs: bytes) -> bytes:
def dleq_challenge( def dleq_challenge(
A: GE, B: GE, C: GE, R1: GE, R2: GE, G: GE = G, m: bytes | None = None A: GE, B: GE, C: GE, R1: GE, R2: GE, m: bytes | None, G: GE = G,
) -> int: ) -> int:
if m is not None: if m is not None:
assert len(m) == 32 assert len(m) == 32
m = bytes([]) if m is None else m.to_bytes(32, "big") m = bytes([]) if m is None else m
return int.from_bytes( return int.from_bytes(
TaggedHash( TaggedHash(
DLEQ_TAG_CHALLENGE, DLEQ_TAG_CHALLENGE,
@ -64,10 +64,10 @@ def dleq_generate_proof(
return None return None
R1 = k * G R1 = k * G
R2 = k * B R2 = k * B
e = dleq_challenge(A, B, C, R1, R2) e = dleq_challenge(A, B, C, R1, R2, m)
s = (k + e * a) % GE.ORDER s = (k + e * a) % GE.ORDER
proof = e.to_bytes(32, "big") + s.to_bytes(32, "big") proof = e.to_bytes(32, "big") + s.to_bytes(32, "big")
if not dleq_verify_proof(A, B, C, proof): if not dleq_verify_proof(A, B, C, proof, m=m):
return None return None
return proof return proof
@ -87,7 +87,7 @@ def dleq_verify_proof(
R2 = s * B + (-e * C) R2 = s * B + (-e * C)
if R2.infinity: if R2.infinity:
return False return False
if e != dleq_challenge(A, B, C, R1, R2): if e != dleq_challenge(A, B, C, R1, R2, m):
return False return False
return True return True