1.Previous
3.Next

value for is 3, but such a small value for may expose vulnerabilities in insecure padding schemes.
#* is released as part of the public key.
# Determine as ; that is, is the modular multiplicative inverse of modulo .
#* This means: solve for the equation ; can be computed efficiently by using the extended Euclidean algorithm, since, thanks to and being coprime, said equation is a form of Bézout's identity,

1.Previous
3.Next