On September 16, 2024, I was invited to give a talk at Google headquarters in Mountain View, California. One of the topics that I spoke about, was computer-checked proofs for papers on symmetric-key cryptography. (It’s really difficult to get these| Nicky Mouha
A wide range of practical problems can easily be solved by SMT solvers such as z3, cvc5, and STP. The idea is to write out the problem as a system of equations and let the solver automatically find a solution (or prove that no solution exists). Amazon Web Services is currently solving a billion SMT queries per day.| Nicky Mouha
Following up on the SHA-3 buffer overflow in the “official” SHA-3 implementation, many people have been asking me how the vulnerability was found…| Nicky Mouha
This is the second post on buffer overflow attacks! Feel free to check out Buffer Overflow Attacks (Part 1) as well.| Nicky Mouha
This is my very first blog post! More will follow…| Nicky Mouha
Update: This result appeared in the proceedings of CT-RSA 2023. A preprint is available.| Nicky Mouha