Cybersecurity, Cryptography.
subgroup of squares in (Z/nZ)*) [1]. This is known as the Decision Diffie-Hellman (DDH) proof, and where g and h are selected from Qn. Basically, a value (x belongs to Qn if gcd(x, N) = 1, and there is a y for x=y^2 (mod N). Overall the method is based on the technique described in “Practical