rich1.0npub1cmt6gqyfw3sdngkq0wadtpe3kmgyyeld6ad0g2h5tar3kpzcrmpqddwklshttps://nostr.ae/npub1cmt6gqyfw3sdngkq0wadtpe3kmgyyeld6ad0g2h5tar3kpzcrmpqddwklsnjumphttps://nostr.ae📅 Original date posted:2018-07-08 📝 Original message:Hi Erik, On Sun, 2018-07-08 at 10:19 -0400, Erik Aronesty via bitcoin-dev wrote: > Consider changing the "e" term in the schnorr algorithm to hash of > message (elligator style) to the power of r, rather than using > concatenation. How do you compute s = x*e if e is an element of group G? (Similar question: How do you verify if e is element of G?) Are you aware of http://cacr.uwaterloo.ca/techreports/2001/corr2001-13.ps ? This is a threshold signature scheme for Schnorr signatures, so what you want is possible already with Schnorr signatures. Best, Tim