SMT in reverse engineering, for dummies

[@MySqueezingArm]

Thank you for the very informative content. Downloaded so I can rewatch a few times to grasp the topic.

[@funtari7]

Kul att det dök upp på min rekommendation så att säga... Tack för undervisningen gubben! 🙏

[@avi-brown]

Thanks, very interesting

[@adumont]

Thanks Carl, great talk, interesting tools, thanks for sharing your method.

[@ZetaTwo]

Thanks! Glad that you enjoyed it!

[@AndrewMorrisintheforest]

This was an incredible talk. Thanks so much for giving it.

[@ZetaTwo]

Thanks! Glad to hear you enjoyed it. Will hopefully create more in the future.

[@DarioCangialosi]

this applies to many fields e.g. cryptographic functions... ;)

[@ZetaTwo]

Dario Cangialosi Actually, any proper cryptographic function is completely immune to this kind of analysis. However some home baked solutions, for example the Petya malware was broken with methods like this.

[@samuelvidal3437]

if you type randomly you have 1 chance in 10 of succeeding it seems

[@ZetaTwo]

Yes, its exactly 1/10 chance since the algorithm just checks that the last digit matches the checksum. The point of the talk however, is not the specific algorithm but the general methodology used to analyze the problem.