Cryptography, Diffie Hellman, Key Exchange, Asymmetric Encryption, Elliptic Curve.
discrete logarithm Diffie–Hellman. To summarize, the flow of Diffie–Hellman key exchange is as follows. Given 2048 bits public prime modulus P and generator G such that G is primitive root modulo P then Alice chooses her secret a Alice sends to Bob her public key A = G^a mod P Bob chooses his