Question: Again I have given you N , e and C . N = 1 7 2 2 1 9 6 0 4 2 9 1

Again I have given you N, e and C.
N =172219604291138178634924980176652297603347655313304280071646410523864939208855547078498922947475940487766894695848119416017067844129458299713889703424997977808694983717968420001033168722360067307143390485095229367172423195469582545920975539060699530956357494837243598213416944408434967474317474605697904676813343577310719430442085422937057220239881971046349315235043163226355302567726074269720408051461805113819456513196492192727498270702594217800502904761235711809203123842506621973488494670663483187137290546241477681096402483981619592515049062514180404818608764516997842633077157249806627735448350463
e =173
# Cryptogramme 1.2
C =25782248377669919648522417068734999301629843637773352461224686415010617355125387994732992745416621651531340476546870510355165303752005023118034265203513423674356501046415839977013701924329378846764632894673783199644549307465659236628983151796254371046814548224159604302737470578495440769408253954186605567492864292071545926487199114612586510433943420051864924177673243381681206265372333749354089535394870714730204499162577825526329944896454450322256563485123081116679246715959621569603725379746870623049834475932535184196208270713675357873579469122917915887954980541308199688932248258654715380981800909
I am relying on you to retrieve the original M. We are given this function to exploit
# exponentiation modulaire
def modular_pow(base, exponent, modulus):
result =1
base = base % modulus
while exponent >0:
if (exponent %2==1):
result =(result * base)% modulus
exponent = exponent >>1
base =(base * base)% modulus
return result
def egcd(a, b):
if a ==0:
return (b,0,1)
else:
g, y, x = egcd(b % a, a)
return (g, x -(b // a)* y, y)
# inverse multiplicatif de a modulo m
def modinv(a, m):
g, x, y = egcd(a, m)
if g !=1:
raise Exception("Pas d'inverse multiplicatif")
else:
return x % m, and this to retrieve the original string which a name of celebrity:# Convertir un entier en une chane de caractres
def int_to_str(n):
# Convertir l'entier en une chane binaire
bin_str = bin(n)[2:]# On enlve le prfixe '0b'
# S'assurer que la longueur de la chane binaire est un multiple de 8
if len(bin_str)%8!=0:
bin_str ='0'*(8- len(bin_str)%8)+ bin_str
# Diviser la chane binaire en groupes de 8 bits
byte_li

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!