Talk:Fiat–Shamir heuristic

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Discrete Logarithm Example?[edit]

Isn't the example using discrete logarithm misleading here, as the Fiat-Shamir procedure of "How to Prove Yourself: Practical Solutions to Identification and Signature Problems" is based on factorisation but not logarithms? --TrevorTrueman (talk) 13:34, 27 August 2019 (UTC)[reply]

Add more explanation[edit]

I think it should be specified that /lambda(q) is the euler totient function, and a link included, not sure how to format it though. 2603:8080:2BF0:FD0:2DCB:77E0:B091:5DEB (talk) 07:23, 1 February 2023 (UTC)[reply]