Created
June 28, 2020 15:30
-
-
Save asdcxsd/f31f81289ea3f2b8d891d5eb4fb65846 to your computer and use it in GitHub Desktop.
writeupCTF
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import gmpy2 | |
from Crypto.Util.number import * | |
n = 2739699434633097765008468371124644741923408864896396205946954196101304653772173210372608955799251139999322976228678445908704975780068946332615022064030241384638601426716056067126300711933438732265846838735860353259574129074615298010047322960704972157930663061480726566962254887144927753449042590678730779046154516549667611603792754880414526688217305247008627664864637891883902537649625488225238118503996674292057904635593729208703096877231276911845233833770015093213639131244386867600956112884383105437861665666273910566732634878464610789895607273567372933766243229798663389032807187003756226177111720510187664096691560511459141773632683383938152396711991246874813205614169161561906148974478519987935950318569760474249427787310865749167740917232799538099494710964837536211535351200520324575676987080484141561336505103872809932354748531675934527453231255132361489570816639925234935907741385330442961877410196615649696508210921 | |
e = 65537 | |
c = 2082926013138674164997791605512226759362824531322433048281306983526001801581956788909408046338065370689701410862433705395338736589120086871506362760060657440410056869674907314204346790554619655855805666327905912762300412323371126871463045993946331927129882715778396764969311565407104426500284824495461252591576672989633930916837016411523983491364869137945678029616541477271287052575817523864089061675401543733151180624855361245733039022140321494471318934716652758163593956711915212195328671373739342124211743835858897895276513396783328942978903764790088495033176253777832808572717335076829539988337505582696026111326821783912902713222712310343791755341823415393931813610365987465739339849380173805882522026704474308541271732478035913770922189429089852921985416202844838873352090355685075965831663443962706473737852392107876993485163981653038588544562512597409585410384189546449890975409183661424334789750460016306977673969147 | |
p, q = gmpy2.iroot(n, 3) | |
press = p - 700*300 | |
i = 0 | |
res = [] | |
while True: | |
press = gmpy2.next_prime(press) | |
if(n %press == 0): | |
res.append(press) | |
i+=1 | |
if press -p > 700*300 : | |
print i | |
break | |
assert res[0]*res[1]*res[2] == n | |
phi = (res[0]-1)*(res[1]-1)*(res[2]-1) | |
d = gmpy2.invert(e, phi); | |
m = pow(c, d, n); | |
print long_to_bytes(m) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment