I loved this.

@ZetaTwo

3 жыл бұрын

Thank you James! Means a lot, and thanks for inspiring to this by creating this campaign.

This is my favorite video in this series (so far)! Have you thought of doing more videos like that, where you give an in dept view of popular exploit of the past?

@ZetaTwo

3 жыл бұрын

Thank you! Glad that you liked it. I have not really thought about what to do next since I was really pushing to get this out before the deadline however that is actually a pretty good suggestion. I noticed that when I was researching this topic that most popular sources were way too simplified or even wrong about how this exploit worked which actually slowed down my work significantly. If you have any specific suggestions, feel free to send them. I have some hectic weeks coming up but I hope to be able to release more videos in a somewhat regular schedule in a not too distant future.

I must say an incredible video.

@ZetaTwo

2 жыл бұрын

Thank you! Glad that you liked it.

Really nice video, thanks for making it.

Cool video, I'll rewatch it in the future.

Good job! Very nice video! :)

This is great, thank you!

This was a fantastic explanation. Incredible video dude.

@ZetaTwo

3 жыл бұрын

Thanks! Glad you liked it!

Great explanation!

@ZetaTwo

Жыл бұрын

Glad you liked it!

wow super hard math

thanks for all videos Mr Zeta i'm from Algeria, and initiating in reverse engineering, since no such thing exists in my country. currently i'm working on reversing an ECU car, and throw my research on internet i've found out that my file looks like the one you solved in RHme2 five years ago 2017, the " FRIDGEJIT" .... got some guidness from liveoverflow, but your video is not complete. would you plz share your solution with me, cause i don't find it any where. i'm stuck with the OS program built on top of the application, no progress, i guess the passion for reverse engineering is not enaugh, u got to have skills and background. thanks in advance.

@ZetaTwo

3 жыл бұрын

I have not documented my solution to that challenge in an easily consumable way. The video LiveOverflow has is all there is. Feel free to send an email to calle.svensson@zeta-two.com with a little bit more description of what you are doing and I will try to point you in the right direction.

1:12 "i do not condone piracy" indeed. 12:51 This implies that the recipient, knowing s, can easily find s^{-1}. OK, I can see how that might be easy if it's easy to factorise n-1. But for one thing, that might not be easy. And for another, didn't you imply that an easier step is secure because it's practically impossible to calculate a modular inverse?

@ZetaTwo

2 жыл бұрын

s^{-1} is just the inverse of s (mod n) which can be efficiently calculated using for example the Extended Euclidean algorithm. No factorization needed. The thing that is difficult to calculate is the discrete logarithm which is a separate problem.

Amazing content. Why would they even use a fixed number for such task? How could this happen?

@ZetaTwo

3 жыл бұрын

Thank a lot! I can come up with a few hypotheses. It could have been that they misunderstood the specification and thought you could generate one random number for everything, or maybe it was some kind of test/debug value to get predictable output for testing or something, or maybe it was a bug in their code.

@FloydMaxwell

3 жыл бұрын

@@ZetaTwo Or a techie wanted to create a flaw on purpose

@ZetaTwo

3 жыл бұрын

@@FloydMaxwell If you want to go more into conspiracy territory, yes that is also a theoretical possibility.

@LiEnby

5 ай бұрын

most likely answer is beacause calling c's rand() function uses a fixed seed by default unless you use srand() to set the seed first.

Loved the video, thanks Sony; dudes, next time hire a profesional mathematician

🤔