I was finally able to capture the modulos and ciphertext that my friend uses to send the flag to everyone. Please hack it, and tell me what he is sending.
Note: Different flag format.
We are giving following data:
1 |
n = 27889790942966947036861378043158080483040875117204641483879866390238208620663956576973777874507240669643888065763137780499805909939066661612708826993608654680300732401951416830721424144957953976708056088725541261145598655543913301108486073727361975257751155861693187124732625567462532590982339774968025316953820269111867532777587735148492283985886531900163665810672858631477638383286430874438461463017230692713981299647992939576135711541276805459680629858238737522674183159028538781619179277007783213596156511625151052311022548741688444363119109174839265715141719292947895928622131533978133711731642378245705631956649 |
That have 1000 group of n and c, so many!
Firstly, I think that could have the same factor. But failed. All n are relatively prime. Stuck! I am no idea. So I begin to do other things.
Suddenly I’m aware of that if e are same(should be same), it might be done by Chinese remainder theorem. You can understand it at wiki, I will not explain it. But no e, don’t worry, we can blast it. So I write a python script to solve the challenge.
1 |
from Crypto.Util.number import bytes_to_long, long_to_bytes |
Although flag isn’t standard format, we can print all the printable message.
Nice!
近期评论