By Topic

IEE Proceedings - Computers and Digital Techniques

Issue 2 • Date Mar 2001

Filter Results

Displaying Results 1 - 7 of 7
  • Threshold signature scheme with multiple signing policies

    Publication Year: 2001, Page(s):95 - 99
    Cited by:  Papers (2)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (468 KB)

    Based on one cryptographic assumption, a basic threshold scheme is derived which allows a group of users to share multiple secrets. The major advantage of the threshold scheme is that only one secret shadow needs to be kept by each user. The basic threshold scheme is applied to design an efficient threshold signature scheme with multiple signing policies. The threshold signature scheme with multip... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deniable authentication protocols

    Publication Year: 2001, Page(s):101 - 104
    Cited by:  Papers (15)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (456 KB)

    Two deniable authentication schemes have been developed. One is based on the intractability of the factoring problem, and the other is based on the intractability of the discrete logarithm problem. The computation cost of the first scheme is about (t+2)/2s. The second scheme requires about (2t+3)/4s of a previous scheme; s is the length of a message block and t is the cost of multiplication mod N ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message latency in k-ary n-cubes with hop-based routing

    Publication Year: 2001, Page(s):89 - 94
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (692 KB)

    Many adaptive routing algorithms for wormhole-routed k-ary n-cubes have been proposed to overcome the performance limitations of deterministic routing. However, before such routing schemes can be successfully incorporated in future practical multicomputers, it is necessary to develop a clear understanding of the factors that affect their potential performance. R.V. Boppanna and S.S. Chalasani (199... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polyphase related-prime sequences

    Publication Year: 2001, Page(s):53 - 62
    Cited by:  Papers (6)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (812 KB)

    The well known family of binary twin-prime sequences is generalised to the multiple-valued case by employing a polyphase representation of the sequence elements. These polyphase versions exhibit similar periodic and aperiodic auto-correlation properties to their binary counterparts, and are referred to as q-phase related-prime (RP) sequences. These sequences have length L=r·s, for r and s b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of disjoint decomposition of balanced Boolean functions through the Walsh spectrum

    Publication Year: 2001, Page(s):71 - 78
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (840 KB)

    Identification of disjunctive decomposition in a balanced Boolean function through Walsh spectra is performed. Balanced Boolean functions occur frequently in common logic circuits such as adders, parity checkers and multiplexers. Various types of decomposition of the balanced functions are considered and the corresponding Walsh spectral conditions that have to be satisfied for their existence an l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reed-Muller tree-based minimisation of fixed polarity Reed-Muller expansions

    Publication Year: 2001, Page(s):63 - 70
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (996 KB)

    A heuristic method for the determination of optimum or near-optimum fixed polarity Reed-Muller (FPRM) representation of multiple output, completely specified Boolean systems is presented. The Reed-Muller (RM) tree representation forms the conceptual framework for the method, which involves manipulations of arrays of cubes. A coding method that is well adapted to RM tree representation is presented... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal algorithm for tree scheduling with unit time communication delays

    Publication Year: 2001, Page(s):79 - 88
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1084 KB)

    A program is usually designed to act as a set of interacting tasks that can be used to construct a graph. These tasks can be assigned to processing elements in different ways. The scheduling problem is applied to defining an assignment of tasks in order to process elements that will optimise certain performance indices. One of the most important reasons for scheduling indices is to try to optimise... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.