quick.links

recent.news

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 [...]

:.home.research3.141592..

basic research is what I am doing when I don't know what I am doing.

pub.lications

  • September 14-10
    - SEC-T 2010: "Vulnerabilities in Full/Virtual Disk Encryption Products"
    Neil Kettle
    Rio theatre, Stockholm, Sweden
    [ presentation (pdf) - abstract ]
  • December 22-09
    - CRESTCon 2009: "[Win32] Full/Virtual Disk Encryption Vulnerabilities"
    Neil Kettle
    15th December, Royal Holloway College, University of London
    [ presentation (pdf) - abstract ]
  • April 19-09
    - CanSec 2009: "Bug classes we have found in *BSD, OS X and Solaris kernels"
    Neil Kettle and Christer Oberg
    Vancouver, Canada
    [ presentation (odp) - presentation (pdf) - abstract ]
  • September 02-08
    - Anytime Algorithms for ROBDD Symmetry Detection and Approximation
    Neil Kettle
    PhD thesis, Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF.
    [ thesis (pdf) - abstract ]
  • June 17-08
    - Bit-Precise Reasoning with Affine Functions
    Neil Kettle and Andy King
    In 1st International Workshop on Bit-Precise Reasoning (BPR-2008)
    [ paper (pdf) - link - abstract ]
  • August 30-07
    - An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs
    Neil Kettle and Andy King
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), IEEE. (Note: Copyright held by IEEE 2007.)
    [ paper (pdf) - link - abstract ]
  • August 10-06
    - Proof of New Decompositional Results for Generalized Symmetries
    Neil Kettle and Andy King
    Technical Report 05-06, Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF.
    [ paper (ps) - abstract ]
  • March 20-06
    - Widening ROBDDs with Prime Implicants
    Neil Kettle, Andy King, and Tadeusz Strzemecki
    In Holger Hermanns and Jens Palsberg, editors, 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 3920 of Lecture Notes in Computer Science, pages 105-119. Springer-Verlag. (Note: see http://www.springer.de/comp/lncs/index.html.)
    [ paper (ps) - paper (pdf) - presentation (pdf) - link - abstract ]
  • February 16-06
    - Proof of New Implicational Relationships between Generalized Symmetries
    Neil Kettle and Andy King
    Technical Report 13-05, Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF.
    [ paper (ps) - abstract ]
  • January 30-06
    - An Anytime Symmetry Detection Algorithm for ROBDDs
    Neil Kettle and Andy King
    In Hidetoshi Onodera, editor, 11th Asia and South Pacific Design Automation Conference (ASPDAC), pages 243-248. IEEE. (Note: Copyright held by IEEE 2006.)
    Abstract: Detecting symmetries is crucial to logic synthesis, technology mapping, detecting function equivalence under unknown input correspondence, and ROBDD minimization. State-of-the-art is represented by Mishchenko's algorithm. In this paper we present an efficient anytime algorithm for detecting symmetries in Boolean functions represented as ROBDDs, that output pairs of symmetric variables until a prescribed time bound is exceeded. The algorithm is complete in that given sufficient time it is guaranteed to find all symmetric pairs. The complexity of this algorithm is in $O(n^4+n|G|+|G|^3)$ where $n$ is the number of variables and $|G|$ the number of nodes in the ROBDD, and it is thus competitive with Mishchenko's $|G|^3$ algorithm in the worst-case since $n << |G|$. However, our algorithm performs significantly better because the anytime approach only requires lightweight data structure support and it offers unique opportunities for optimization.
    [ paper (ps) - paper (pdf) - presentation (pdf) - link - no abstract ]

vuln.erabilities