2010-09-14 - the slides from my recent (re-)presentation (with lots of extra bits) at SEC-T 2010, will soon be online! exploit code [...]

2009-12-18 - The slides from my recent presentation at CRESTCon 2009, the 'replacement' for CHECKCon, are now online! exploit code for the demonstrations [...]


there is properly no history; only biography


digit-labs was formed late in 1999, and consisted of members who were interested in information security. The members of digit-labs spent many a happless hour researching vulnerabilities/coding and generally making a nuisance of themselves. We were firm believers in the full disclosure philosophy since we believe that it will benefit the internet community in the long run (or something like that, after all, everyone likes a good 0day). This website was the place where all the material borne from our research was to be located.

This site has now become the homepage of the single remaining member of the original digit-labs.org (mu-b).


My main area of interest lies in Theoretical Computer Science, particularly complexity theory and algorithmics (especially for hard problems). In an academic sense, my research activities involve program analysis and abstract interpretation with specific focus on the applicability (i.e. tractability) of Boolean functions (and propositional logic) as an abstract domain for program analysis. However, I also have a somewhat unhealthy interest in Computer Security, specifically the practical implications of various types of software related vulnerabilities and the application of abstract interpretation program analysis techniques to finding such vulnerabilities. A list (albiet non-complete) of publications I have authored can be found in the research section (or DBLP, UKC).

In my spare time I disclose (from time to time) security vulnerabilities (and very rarely exploits) in open-source and closed-source software.


In fitting with my interest in computationally 'hard' problems, I intend to release 'challenge' instances of well-known computationally 'hard' problems (i.e. SAT, K-colorability) for "interested" parties to try and solve!