Security, Diffie Hellman, Cryptography, Nodejs.
multiple of n and we wright : primitive root a primitive root of a prime number p is one whose powers modulo p generate all the integers from 1 to p - 1 .for example if b is primitive root of p then the set defined below includes all integers between 1 and p-1 Diffie-Hellman algorithm is used for