Multiply them to get "n = p*q." Next, you pick a small public exponent "e" which is the "encryption exponent" and a specially crafted inverse of "e" called "d" as the "decryption exponent."
接下来，取一个较小的“e”作为 指数，它用作“加密指数”，而对e的进行特殊的逆反函数计算所得到的“d”作为“解密指数”。
Just as interesting is that the person with "d" can "sign" a document by raising a message "m" to the "d" exponent.
另一件有意思的事情是拿着“d”的人可以对一个文档进行签名，其做法是文档“M”求“d”次幂然后应用模数“n”求余数“S”。
应用推荐