13639457
On the independence of Boolean functions
Boolean functions are widely used because they can be used to precisely describe logical circuits. Properties of Boolean functions with respect to their applications to cryptography have been studied, but relationship between Boolean functions are rarely studied. This paper studies the independence of Boolean functions, gives necessary and sufficient conditions for judging whether two given Boolean functions are independent. Some enumeration formulae are given.
414035
Internet voting: concerns and solutions
Internet voting systems, catering to different requirements, have been widely implemented and used. Some have been successful, while others have experienced unexpected problems. This paper overviews the concerns of using Internet voting and tries to give solutions. Tradeoffs between the advantages and disadvantages of employing Internet voting are also addressed. A simple protocol is designed to show that technical problems identified in the literature can be solved fairly easily, though some seem subtle. This study reveals that the main concerns of adopting Internet voting for critical elections are not cryptographic tools, but hardware and software reliability, and social and political issues. After discussing possible concerns about Internet voting and possible solutions or comments, we propose steps to enable Internet voting to be adopted even for critical elections.
26993316
Construction of Cryptographically Important Boolean Permutations
Abstract.In this paper a new general methodology is developed to construct Boolean permutations such that any non-trivial linear combination of their components has the largest algebraic degree.
41090415
Correlation immunity and resiliency of symmetric Boolean functions
Correlation immunity of symmetric Boolean functions is studied in this paper. Lower bounds on the number of constructible correlation immune symmetric functions are given. Constructions for such new balanced functions are presented. These functions are also known as 1-resilient functions. In 1985, Chor et al. conjectured that the only 1-resilient symmetric functions are the exclusive-or of all n variables and its negation. This conjecture, however, was disproved by Gopalakrishnan, Hoffman and Stinson in 1993 by giving a class of infinite counterexamples, and they noted that it does not seem to extend any further in an obvious way. In this paper two more infinite classes of such examples are presented for n being even and being odd, respectively, and consequently one of the two open problems proposed by Gopalakrishnan et al., is addressed by constructing new symmetric resilient functions.
47400657
Construction of correlation immune Boolean functions
It is shown in this paper that every correlation immune Boolean function of n variables can be written as f(x) = g(xGT ), where g is an algebraic non-degenerate Boolean function of k (k ≤ n) variables and G is a generating matrix of an [n, k, d] linear code. It is known that the correlation immunity of f (x) is at least d − 1. In this paper we further prove when the correlation immunity exceeds this lower bound. A method which can theoretically search exhaustively all possible correlation immune functions is proposed, while constructions of higher order correlation immune functions as well as algebraic non-degenerate correlation immune functions are discussed in particular. It is also shown that many cryptographic properties of g can be inherited by the correlation immune function f (x) = g(xGT) which is an important property for choosing useful correlation immune functions.
11048111
Modified Chinese remainder theorem and its application to proxy signatures
Chinese Remainder Theorem has been used for hundreds of years and has been applied to many domains such as integers and polynomials. An assumption made is that the component moduli are pairwise co-prime. In this paper, first we remove this assumption; then we give an algorithm to find whether a given system of congruent equations has a solution, and if so, how to find the solution in an efficient manner. Further we apply the modified Chinese Remainder Theorem to design proxy signatures.
206622161
The Reverse-Exchange Interconnection Network
Properties of the reverse-exchange interconnection network are used to develop a reconfiguration scheme and a two-pass structure for enhancing the efficiency of a class of multistage interconnection networks. Functional relationships among a class of multistage interconnection networks are first derived. According to the functional relationships, we propose a reconfiguration scheme which enables a network to accomplish various interconnection functions of other networks. Then the admissible permutations along with related recursive control algorithms of the reverse-exchange interconnection network are specified through a set of theorems. Using the reverse-exchange property, we also prove that the algorithms actually work. Finally, we prove that arbitrary permutations can be realized in two passes (or 2 · 1og2N switching steps where N is the network size). By taking advantage of Benes network control algorithms, a way to control the two-pass structure is also developed.
5170715
Distributed Instruction Set Computer
The Distributed Instruction Set Computer, or DISC for short, is an experimental computer system for fine-grained parallel processing. DISC employs a new parallel instruction set, an Early Binding and Scheduling data tagging scheme, and a distributed control mechanism to explore a software dataflow control method in a multiple-functional-unit system. 
With "zero" system control overhead, multiple instructions are executed in parallel and/or out of order at the highest speed of n instructions/cycle, where n is the number of functional units. The quantitative simulation result indicates that a DISC system with 16 functional units can deliverer a maximal 7.7X performance speedup over a single-functional-unit system at the same clock speed. 
Exploring a new parallel instruction set and distributed control mechanism, DISC represents three major breakthroughs in the domain of fine-grained parallel processing: (1) Fast multiple instruction issuing mechanism; (2) Parallel and/or out-of-order execution; (3) Software dataflow control scheme.
6353106
The Universal Protein Resource (UniProt): an expanding universe of protein information
The Universal Protein Resource (UniProt) provides a central resource on protein sequences and functional annotation with three database components, each addressing a key need in protein bioinformatics. The UniProt Knowledgebase (UniProtKB), comprising the manually annotated UniProtKB/Swiss-Prot section and the automatically annotated UniProtKB/TrEMBL section, is the preeminent storehouse of protein annotation. The extensive cross-references, functional and feature annotations and literature-based evidence attribution enable scientists to analyse proteins and query across databases. The UniProt Reference Clusters (UniRef) speed similarity searches via sequence space compression by merging sequences that are 100% (UniRef100), 90% (UniRef90) or 50% (UniRef50) identical. Finally, the UniProt Archive (UniParc) stores all publicly available protein sequences, containing the history of sequence data with links to the source databases. UniProt databases continue to grow in size and in availability of information. Recent and upcoming changes to database contents, formats, controlled vocabularies and services are described. New download availability includes all major releases of UniProtKB, sequence collections by taxonomic division and complete proteomes. A bibliography mapping service has been added, and an ID mapping service will be available soon. UniProt databases can be accessed online at or downloaded at .
26616615
On a Class of Multistage Interconnection Networks
A baseline network and a configuration concept are introduced to evaluate relationships among some proposed multistage interconnection networks. It is proven that the data manipulator (modified version), flip network, omega network, indirect binary n-cube network, and regular SW banyan network (S = F = 2) are topologically equivalent. The configuration concept facilitates developing a homogeneous routing algorithm which allows one-to-one and one- to-many connections from an arbitrary side of a network to the other side. This routing algorithm is extended to full communication which allows connections between terminals on the same side of a network. A conflict resolution scheme is also included. Some practical implications of our results are presented for further research.
6100465
A distributed connection manager interface for web services on IBM SP systems
In essence, the World Wide Web is a worldwide string of computer databases using a common information retrieval architecture. With the increasing popularity of the World Wide Web, more and more functions have been added to retrieve not only documents written in HTML (Hypertext Markup Language), but also those in other forms through the Common Gateway Interface (CGI), by constructing HTML documents dynamically. Dynamic construction of HTML documents for handling information such as digital libraries is slow and requires much more computer power. A significant performance bottleneck is the initialization and setup phase for a CGI process to gain access to the system containing the data. In this paper we describe the design and implementation of a Connection Manager Interface on IBM SP systems. The Connection Manager provides cliette processes to serve CGI requests and eliminates such bottlenecks. An IBM SP system is used for this emerging area to show that our design and implementation is flexible enough to take advantage of the High-Performance Switch in an IBM SP system. We trace and monitor this scalable Web services using UTE (Unified Trace Environment) tools, and present its performance analysis and visualization.