Cryptographic Applications of Th -residuosity Problem with an Odd Integer


Let and n be positive integers. An integer z with gcd(z; n) = 1 is called a -residue modn if there exists an integer x such that z x (mod n), or a -nonresidue modn if there doesn't exist such an x. Denote by Z n the set of integers relatively prime to n between 0 and n. The problem of determining whether or not a randomly selected element z 2 Z n is a… (More)