import gmpy2
import libnum
from Crypto.Util.number import *
#from binascii import a2b_hex,b2a_hex
flag = "*****************" #flag为m
p = 262248800182277040650192055439906580479
q = 262854994239322828547925595487519915551
e = 65533
n = p*q
d = gmpy2.invert(e,(p-1)*(q-1))
print(d)
#c = pow(int(b2a_hex(flag),16),e,n)
#print c
c = 27565231154623519221597938803435789010285480123476977081867877272451638645710
# c = m^e % n
# m = c^d % n
m = pow(c,d,n)
print(m)
print(long_to_bytes(2077392566271395359695912870032509))
# 51938044911383735496696766945348482589325573182146510406365903911685548598997
# 2077392566271395359695912870032509
# b'flag{B4by_Rs4}'
[HDCTF2019]basic rsa
最新推荐文章于 2024-10-06 10:13:11 发布