tag:blogger.com,1999:blog-2752058700154467226.post7920638793102203105..comments2024-03-09T10:23:37.496+00:00Comments on Bristol Cryptography Blog: 52 Things: Number 16: Describe the key generation, signature and verification algorithms for DSA, Schnorr and RSA-FDH.Bogdanhttp://www.blogger.com/profile/13266116282208635140noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-2752058700154467226.post-84500820807975675392015-03-04T00:27:25.346+00:002015-03-04T00:27:25.346+00:00It is just y to the power minus r. So we just need...It is just y to the power minus r. So we just need to exponentiate by q-yNigel Smarthttps://www.blogger.com/profile/17681184541012804026noreply@blogger.comtag:blogger.com,1999:blog-2752058700154467226.post-18778681026081771392015-02-08T22:11:32.759+00:002015-02-08T22:11:32.759+00:00any links to explain how the r-th root of y is cal...any links to explain how the r-th root of y is calculated in the Schnorr's algorithm?Mike Woodhttps://www.blogger.com/profile/10219643878866008794noreply@blogger.com