Skip to content

Instantly share code, notes, and snippets.

@AndyNovo

AndyNovo/prersa.py Secret

Last active March 3, 2019 21:23
Show Gist options
  • Save AndyNovo/c1cdb4cfb6a22880e5b1f188c6916c9d to your computer and use it in GitHub Desktop.
Save AndyNovo/c1cdb4cfb6a22880e5b1f188c6916c9d to your computer and use it in GitHub Desktop.
Download ZIP
Raw
prersa.py
e=41
ct=6188818030907481072253078335162633433026604746106687074071962388699313254017309819874179194919380348627683825959840174
N=9088764232169908645199316100532049895348624028817640325540432611305119465526977863974243071472309448327577698390818373
#So ct = pt^e % N what's pt?
#If you calculate the inverse of 41 modulo phi(N) then ct^(that inverse) % N should be pt.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment