Answer:
1. An RSA cipher is 190063737424545672613894635544405399 and N= 982721632467543108444695703066226853. By cracking N into p and q, decrypt cipher message.
Additional information:
Details [here]. First factorize N into p and q (here). This will give you p and q (the two prime numbers). Next we determine PHI=(p−1)(q−1). Next we derive d (the decryption key value) from e and PHI. Then decipher with Msg=C^d (mod N). Sample Python code: from Crypto.Util.number import * import gmpy2 import sys p=954354002755510667 q=801297755486859913 c=607778777406675887172756406181993732 #N=764721720347891218098402268606191971 n = p*q PHI=(p-1)*(q-1) e=65537 d=(gmpy2.invert(e, PHI)) res=pow(c,d, n) print "Cipher: ",c print "p: ",p print "q: ",q print "=== Calc ===" print "d=",d print "n=",n print "Decrypt: %s" % ((long_to_bytes(res)))
Ans: opal