查看题目
观察题目给的条件,给了p+q,(p+1)(q+1),e,d,以及密文C.
RSA的解密公式:M=C^d mod n
所以我们只要求出n即可。(n = pq)
n = (p+1)(q+1) - (p+q) - 1
求M的值,已知C,d,n后 用函数pow(),即可求出
import libnum
a = 0x1232fecb92adead91613e7d9ae5e36fe6bb765317d6ed38ad890b4073539a6231a6620584cea5730b5af83a3e80cf30141282c97be4400e33307573af6b25e2ea
b = 0x5248becef1d925d45705a7302700d6a0ffe5877fddf9451a9c1181c4d82365806085fd86fbaab08b6fc66a967b2566d743c626547203b34ea3fdb1bc06dd3bb765fd8b919e3bd2cb15bc175c9498f9d9a0e216c2dde64d81255fa4c05a1ee619fc1fc505285a239e7bc655ec6605d9693078b8