Cryptography, Cybersecruity.
method [2]: First we select two large prime numbers (p and q) and compute: and where lcm is the least common multiple. We then select random integer g for: We must make sure that n divides the order of g by checking the following: and where Lis defined as L(x)=x−1n. The public key is (n,g) and the