Chinese Remainder Theorem | PicoCTF 2017 [32] Weird RSA

[@mehh5505]

Subscribed

[@_JohnHammond]

Yay, thank you!!

[@mehh5505]

😀

[@اشرفالقايدي]

Python is a difficult language

[@94muehli]

Is there no module for that in python? It seems so weird that this has to be done step by step

[@bobbysue517]

how do you do the print statement in python 3?

[@bobbysue517]

i finally got it to work but i imagine there is a better way. I added the following code. I just could not get it to work on one line. byt = (hex(m)[2:]) x = bytes.fromhex(byt).decode('utf-8') print(x)

[@temingtiong8071]

Hey guys. I have 1 question about the calculation of h. Can anyone explain to me why we do not need to include the mod p in the calculation of h ?

[@PanicAtTehCisco]

It might be that the resulting h is smaller than p, so taking its modulus would return the same number.

[@armon2681]

Secondn't

[@mikopiko]

Firsn't