- Solving Circuit Optimisation Problems in Cryptography and Cryptanalysis, IACR Cryptology ePrint Archive 2011
- A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications, CoRR abs/1108.2830 2011
- A New Reduction from 3SAT to n-Partite Graphs, FOCI 2007
- Multiplicative Complexity and Solving Generalized Brent Equations With SAT Solvers, COMPUTATION TOOLS 2012
- Solving Circuit Optimisation Problems in Cryptography and Cryptanalysis, SHARCS 2012
- On Bad Randomness and Cloning of Contactless Payment and Building Smart Cards, IEEE Security and Privacy Workshops 2013
- The Path to Satisfaction: Polynomial Algorithms for SAT, EngD Thesis 2008
View UCL's YouTube TV Channel on: