This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing Low‑importance This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles Low This article has been rated as Low-importance on the project's importance scale.

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

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