e = 65537
n = 2607951329729065939867317638048959596199322476283
c = 0x14664b580f3ccf1db9f3de7196093d4620ea65117
https://factordb.com/ 에 n 값 넣고 소인수분해
p = 1144714727597600915355601
q = 2278254369280582378121483
RSA 복호화 계산
ϕ(n)=(p−1)(q−1)
d × e≡ 1(modϕ(n))
m = c^d mod n
m=24589826276506710398206500778199108239741
UTF-8로 디코딩 HCTF{flag_is_RSA}