Teow-Hin Ngair

Learn More
In this paper we present a method of attacking public-key cryptosystems (PKCs) on tamper resistant devices. The attack makes use of transient faults and seems applicable to many types of PKCs. In particular, we show how to attack the RSA, the ElGamal signature scheme, the Schnorr signature scheme, and the DSA. We also present some possible methods to(More)
Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first transformed into a CNF formula. This process, however, requires exponential time in the worst case and can result in an exponential blow up of the input size. Such cases occur(More)
This paper exposes the common order-theoretic properties of the structures manipulated by the version space algorithm [Mit78]and the assumption-based truth maintenance systems (ATMS) [dk86a,dk86b] by recasting them in the framework of convex spaces. Our analysis of version spaces in this framework reveals necessary and sufficient conditions for ensuring the(More)
In this paper we present a theory of anti-chains as data representations for sets in circumstances where sets of interest satisfy properties such as being upward-closed or convex relative to a partial ordering. Our goal is to provide an interface for supplying an implementation of the necessary primitives in a reusable manner and a theory that will(More)
  • 1