Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.
Sign up to join this community
https://link.springer.com/content/pdf/10.1007/3-540-49649-1_18.pdf
In class I, why (4) implies $g\equiv 1 \mod q$
Also even though I get $p$ and $q$ it still can't get $ord_n(g)$ without trying out different possibilities or is there a way to do all forgery?
