Skip to content

Instantly share code, notes, and snippets.

@niklasb
Last active October 10, 2018 11:17
Show Gist options
  • Star 1 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save niklasb/93c4210f74be64588693165a3969bdc0 to your computer and use it in GitHub Desktop.
Save niklasb/93c4210f74be64588693165a3969bdc0 to your computer and use it in GitHub Desktop.
from sage.all import continued_fraction, Integer, inverse_mod
pubkey = (1696852658826990842058316561963467335977986730245296081842693913454799128341723605666024757923000936875008280288574503060506225324560725525210728761064310034604441130912702077320696660565727540525259413564999213382434231194132697630244074950529107794905761549606578049632101483460345878198682237227139704889943489709170676301481918176902970896183163611197618458670928730764124354693594769219086662173889094843054787693685403229558143793832013288487194871165461567L, 814161885590044357190593282132583612817366020133424034468187008267919006610450334193936389251944312061685926620628676079561886595567219325737685515818965422518820810326234612624290774570873983198113409686391355443155606621049101005048872030700143084978689888823664771959905075795440800042648923901406744546140059930315752131296763893979780940230041254506456283030727953969468933552050776243515721233426119581636614777596169466339421956338478341355508343072697451L, 171012227587318507773834753911094468358648971527111097308935888531930900156798659257578479378777764146070352809723708236353390208094909385240006920137781562826981091183813955039359863361624869703055918575613667858215532572602435432258750639197322091887713402631456113333645709142822182724397962837201266977523L, 96969753191136466007366303619618019752521508403657426306543836447071659732926802256183021740376016065813234292694535879838415771865207311953800116203362150588941093508091412441933752168889516206420588410478242229762908362637083786338280959547015086176046206126019992386890758970740552952647510652431386064722L)
c=(1569733526826523065259704222721381245770313117205865099913421859731162526943498524936251685846967970606251353344665893442015804015671457823645874503670136308040791285744658847419176471348768113798503897694020110157476679833746227801224812046930570487233225157924912272791212802495997329083436189937249314855532400635293522270501567950040825794060896420481676398789310029592608176167251882124182145471818654414925639589921023176070657483148482403065241178276749773L, 139537660044872985880471632333334179976891152860359271230202507995985566816703080930428310461057387079799847266510420206696052591677854190150642820963140050439023069266243433278700748622126726137374130247097863526461696642750021196138340072411724739383716017406022211953417323065831672315854246554523225039827L)
def wiener(e, n):
q0 = 1
M = 1333337
C = pow(M, e, n)
for x in continued_fraction(Integer(e) / Integer(n)).convergents():
q1 = int(x.denominator())
for r in range(10):
for s in range(10):
d = r*q1 + s*q0
if pow(C, d, n) == M:
return d
q0 = q1
n, e, a, g = pubkey
c1, c2 = c
d = wiener(e, n)
# d = 100556095937036905102538523179832446199526507742826168666218687736467897968451
k = pow(c1, d, n)
K = pow(g, k, a)
print '{:x}'.format(c2 * inverse_mod(K, a) % a).decode('hex')
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment