October 24, 2022 at 5:28 PM
October 24, 2022 at 5:32 PM October 24, 2022 at 5:41 PM Great! October 24, 2022 at 5:47 PM Thank you October 24, 2022 at 5:47 PM October 24, 2022 at 5:55 PM (October 24, 2022, 01:50 PM)Hacker2222 Wrote: plz discuss here Thanks October 24, 2022 at 5:59 PM thanks October 24, 2022 at 6:00 PM (October 24, 2022, 05:47 PM)lollole Wrote:(October 24, 2022, 02:32 PM)killerbee Wrote: for crypto compute the gcd of c1 -c2 and N is p gcd of (c1 - c2 , N) == p this is because p | N and the forms of c1 and c2 leads to haveing c1-c2 = p ^e1 - p^e2 mod N so you can inverse encryption by the formula c1 - p ^e1 = m mod N October 24, 2022 at 6:11 PM thanks October 24, 2022 at 6:32 PM (October 24, 2022, 04:31 PM)Hacker2222 Wrote:(October 24, 2022, 04:00 PM)karhu Wrote: Reverse and Forensics were pretty simple Just working on Web now. SQLi is returning a bunch of bcrpyt hashes, but JtR isn't cracking them. I used vipermonkey for forensics challenge. Check it out :). |
