Score:0

Schnorr signature | Schnorr Public Parameters

pk flag

hello guys hope you are doing well :),

i am trying to simulate the Schnorr Signature, but i have encountered some difficulties finding the generator,

i have chosen a prime P of 1024bit and took a factor of 160bit as Q but for the generator i'm trying to produce,

i'm using the equation => g^Q = 1 mod P

how can i implement this in python, and if this approach is not good please guide me...

thanks.

knaccc avatar
es flag
You can use this "1024-bit MODP Group with 160-bit Prime Order Subgroup" here: https://datatracker.ietf.org/doc/html/rfc5114#section-2.1
Amir Amara avatar
pk flag
how does this method differ from using elliptic curve?
knaccc avatar
es flag
Schnorr signatures with elliptic curves are very similar to signatures with MODP groups, and will be much more compact.
Amir Amara avatar
pk flag
thank you very much dear :)
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.