Showing papers by "Chris J. Mitchell published in 1994"
••
TL;DR: The security, complexity, and application of two schemes for using an untrusted auxiliary processor to aid smart card RSA signature computations are reviewed, including detailed analysis of possible methods of attack.
Abstract: The security, complexity, and application of two schemes for using an untrusted auxiliary processor to aid smart card RSA signature computations are reviewed, including detailed analysis of possible methods of attack. Guidance is given on practical, secure use of these schemes. >
36 citations
••
TL;DR: New constructions for (binary) Perfect Maps and 2k-ary de Bruijn sequences are presented and are significant because the Maps they yield can be efficiently decoded.
Abstract: Perfect Maps are two-dimensional arrays in which every possible sub-array of a certain size occurs exactly once. They are a generalisation of the de Bruijn sequences to two dimensions and are of practical significance in certain position location applications. In such applications the decoding problem, i.e. resolving the position of a particular sub-array within a specified Perfect Map, is of great significance. In this paper new constructions for (binary) Perfect Maps and 2 k -ary de Bruijn sequences are presented. These construction methods, although not yielding Perfect Maps for new sets of parameters, are significant because the Maps they yield can be efficiently decoded.
22 citations
••
TL;DR: The purpose of this paper is to prove the equivalence of perfect authentication schemes and maximum distance separable codes.
Abstract: The purpose of this paper is to prove the equivalence of perfect authentication schemes and maximum distance separable codes.
15 citations
••
TL;DR: Recursion constructions for four infinite families of two-dimensional perfect binary arrays, using only elementary methods are given, which are equivalent to a Menon difference set in an abelian group.
11 citations
••
TL;DR: This paper conjecture that the same is true for arbitrary values ofc, and exhibit a number of constructions that construct a family of related combinatorial objects, which are called Perfect Multi-factors.
Abstract: Ac-ary Perfect Factor is a set of uniformly long cycles whose elements are drawn from a set of sizec, in which every possiblev-tuple of elements occurs exactly once. In the binary case, i.e. wherec=2, these perfect factors have previously been studied by Etzion [2], who showed that the obvious necessary conditions for their existence are in fact sufficient. This result has recently been extended by Paterson [4], who has shown that the necessary existence conditions are sufficient wheneverc is a prime power. In this paper we conjecture that the same is true for arbitrary values ofc, and exhibit a number of constructions. We also construct a family of related combinatorial objects, which we callPerfect Multi-factors.
7 citations