[英]Finding private key in RSA
I've been trying to figure out how to find the private key in the RSA equation with no luck.我一直试图弄清楚如何在没有运气的情况下在 RSA 方程中找到私钥。 Given给定的
p = 31
q = 23
e = 223
phi = (p-1)(q-1)
= 660
The equation (d*e mod phi = 1) results in;等式 (d*e mod phi = 1) 导致;
e mod phi = 1/d
so所以
223 mod 660 = 1/d
223 = 1/d
1/223 = d
but in this example they get d = 367, which I can't get.但在这个例子中,他们得到 d = 367,这是我无法得到的。 What am I doing wrong?我究竟做错了什么?
Calculating d is not that simple.计算 d 并不是那么简单。 You can use the extended Euclidean algorithm to solve for d.您可以使用扩展的欧几里得算法来求解 d。
d=1/e mod phi
For RSA, how do i calculate the secret exponent?对于 RSA,我如何计算秘密指数?
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.