Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

docs: Update Schnorr spec regarding nonce randomness #53

Merged
merged 1 commit into from
Oct 1, 2024
Merged

docs: Update Schnorr spec regarding nonce randomness #53

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 1 addition & 5 deletions docs/Schnorr.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,11 +22,7 @@ elliptic curve. The scheme is used by _Chronicle Protocol_'s Scribe oracle contr

## Signing

1. Select a _cryptographically secure_ `k ∊ [1, Q)`

Note that `k` can be deterministically constructed via `H(x ‖ m) mod Q`.
This construction keeps `k` random for everyone not knowing the private key
`x` while it also ensures a nonce is never reused for different messages.
1. Select a _cryptographically secure random_ `k ∊ [1, Q)`

2. Compute `R = [k]G`

Expand Down
Loading