One strategy in implementing this is using a number with a small Hamming weight, such as 3 or 17, in order to optimize the amount of modular multiplications; that number is usually denoted e. It also 
One strategy in implementing this is using a number with a small Hamming weight, such as 3 or 17, in order to optimize the amount of modular multiplications; that number is usually denoted e. It also makes use of the Extended Euclidean Algorithm to find a number denoted d, which is congruent to e raised to the negative first power modulus phi, where phi denotes the (*) totient function of the distinct integers p and q. The greatest common divisor of e and phi is 1, meaning that those two numbers are coprime, and phi ends up being equal to (p-1)(q-1) [p minus 1 times q minus 1] since both p and q are prime numbers. Based heavily on Fermat's Little Theorem, this system often makes use of a signature system and uses e and d in its public and private keys, respectively. Relying on the fact that large integers are difficult to factor, this is, for 10 points, what popular cryptography algorithm which is named after its three developers?
One strategy in implementing this is using a number with a small Hamming weight, such as 3 or 17, in order to optimize the amount of modular multiplications; that number is usually denoted
{RSA} cryptography or algorithm or {cryptosystem} [or {Rivest}, {Shamir}, {Adleman}]