Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with schnorr-signature
Search options answers only
not deleted
user 87477
A digital signature algorithm based on the discrete logarithm problem, provably secure in the random oracle model.
4
votes
Accepted
How are signature operations like hashing or concatenating with a message done when the inpu...
The standard ways to encode elliptic curve points to byte strings are outlined in the SEC 1 document section 2.3.3
There is a choice to use a compressed or uncompressed form. In both cases the full 0- …
- 26.4k
3
votes
Convert a Schnorr Public Key to a compressed ECDSA Public Key
TL;DR
0x02 for an unmodified Schnorr signature scheme with typical implicit $y$ coordinates; with BIP0340 one can only convert if one has access to the private key (see fgrieu's answer).
Background
El …
- 26.4k
1
vote
Accepted
Necessary Schnorr signature non-interactive challenge bindings
It's a rather contrived scenario, but suppose that there are two verification keys $X_1=x_1G$ and $X_2=x_2G$ belonging to two distinct signers and suppose that the attacker does not know either $x_1$ …
- 26.4k
7
votes
Accepted
Is the security of a Schnorr signature dependent on the hash function that is used?
It does contribute to the security. In particular, the hash function $H$ must be “random prefix preimage resistant” in order to be safe from Key Only forgeries and “random prefix second preimage resis …
- 26.4k