Cryptography, Diffie Hellman, Key Exchange, Asymmetric Encryption, Elliptic Curve.
modulus such that at least 2048 bits safe-prime because Q is also prime G is generator such that G is primitive root modulo P We say that G is primitive root modulo P if for each 1 ≤ a ≤ P − 1 the A = G^a mod P is unique and belongs to the set {1, 2, . . . , P − 1}. The period of such cyclic group