buuctf BabyRSA
首先查看给的已知条件
分析已知条件,已知密文c,p+q,(p+1)(q+1),e,d求明文得到flag
由(p+1)(q+1)和p+q可计算得到pq,也就是n
明文m=c^d mod n;
代码:
#(p+1)(q+1)
f=0x5248becef1d925d45705a7302700d6a0ffe5877fddf9451a9c1181c4d82365806085fd86fbaab08b6fc66a967b2566d743c626547203b34ea3fdb1bc06dd3bb765fd8b919e3bd2cb15bc175c9498f9d9a0e216c2dde64d81255fa4c05a1ee619fc1fc505285a239e7bc655ec6605d9693078b800ee80931a7a0c84f33c851740
#p+q
s=0x1232fecb92adead91613e7d9ae5e36fe6bb765317d6ed38ad890b4073539a6231a6620584cea5730b5af83a3