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.
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.
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.
15213655
The design and implementation of intelligent transportation Web services
The paper presents the design and implementation of an intelligent transportation Web service (ITWS) and studies various QoS requirements for the Web service infrastructure. In particular, we pay attention to the performance issues on ITWS data transmission and compression. Since SOAP message is a textual document, we can improve the data transmission time by compressing data on transmission. In our experiment, compressing data before or after SOAP serialization both can reduce the size of transmitted message down to as little as 2% and cut the response time to a quarter of the original message.
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.
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.
14697178
Design of integrated multimedia compression and encryption systems
Two approaches for integrating encryption with multimedia compression systems are studied in this research, i.e., selective encryption and modified entropy coders with multiple statistical models. First, we examine the limitations of selective encryption using cryptanalysis, and provide examples that use selective encryption successfully. Two rules to determine whether selective encryption is suitable for a compression system are concluded. Next, we propose another approach that turns entropy coders into encryption ciphers using multiple statistical models. Two specific encryption schemes are obtained by applying this approach to the Huffman coder and the QM coder. It is shown that security is achieved without sacrificing the compression performance and the computational speed. This modified entropy coding methodology can be applied to most modern compressed audio/video such as MPEG audio, MPEG video, and JPEG/JPEG2000 images.
206015400
Genetic-algorithm-based real-time task scheduling with multiple goals
This paper presents and evaluates a new method for real-time task scheduling in multiprocessor systems. Its objectives are to minimize the number of processors required and the total tardiness of tasks. The minimization is carried out through a multiobjective genetic algorithm (GA), because the problem has non-commensurable and competing objectives to be optimized. The experimental results showed that when compared to five methods used previously, such as list-scheduling algorithms and a specific GA, the performance of our algorithm was comparable or better for 178 out of 180 randomly generated task graphs. Also shown is the impact of the sparsity of a task graph on the performance of our algorithm.