mirrors/bitcoin-bips
1
0
Fork 0
mirror of https://github.com/bitcoin/bips.git synced 2025-03-04 11:08:05 +01:00
Code Issues Projects Releases Wiki Activity

Lowercase secp

Browse source 
Co-authored-by: Sebastian Falbesoner <sebastian.falbesoner@gmail.com>
This commit is contained in:
Andrew Toth 2024-12-10 19:17:46 -05:00 • committed by GitHub
parent b5d47dfef9
commit 597004acef
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
bip-DLEQ.mediawiki
View file

@ -40,7 +40,7 @@ Input:
* The secret key ''a'': a 256-bit unsigned integer * The secret key ''a'': a 256-bit unsigned integer
* The public key ''B'': a point on the curve * The public key ''B'': a point on the curve
* Auxiliary random data ''r'': a 32-byte array * Auxiliary random data ''r'': a 32-byte array
* The generator point ''G'': a point on the curve<ref name="why_include_G"> ''' Why include the generator point G as an input?''' While all other BIPs have used the generator point from Secp256k1, passing it as an input here lets this algorithm be used for other curves.</ref> * The generator point ''G'': a point on the curve<ref name="why_include_G"> ''' Why include the generator point G as an input?''' While all other BIPs have used the generator point from secp256k1, passing it as an input here lets this algorithm be used for other curves.</ref>
* An optional message ''m'': a 32-byte array<ref name="why_include_a_message"> ''' Why include a message as an input?''' This could be useful for protocols that want to authorize on a compound statement, not just knowledge of a scalar. This allows the protocol to combine knowledge of the scalar and the statement.</ref> * An optional message ''m'': a 32-byte array<ref name="why_include_a_message"> ''' Why include a message as an input?''' This could be useful for protocols that want to authorize on a compound statement, not just knowledge of a scalar. This allows the protocol to combine knowledge of the scalar and the statement.</ref>
The algorithm ''GenerateProof(a, B, r, G, m)'' is defined as: The algorithm ''GenerateProof(a, B, r, G, m)'' is defined as: