34199617
An Integrity Check Value Algorithm for Stream Ciphers
A method of calculating an integrity check value (icv) with the use of a stream cipher is presented. The strength of the message integrity this provides is analysed and proven to be dependent on the unpredictability of the stream cipher used. A way of efficiently providing both integrity and encryption with the use of a single stream cipher is also explained. Note that the method of providing message integrity, used with or without encryption, is not subject to a number of attacks that succeed against many conventional integrity schemes. Specifically any legitimate message-icv pair that is copied or removed and subsequently replayed will have an appropriately small small chance of deceiving the receiver. Furthermore, any message-icv pair generated by an attacker and injected into the communication channel will have an appropriately small chance of escaping detection unless the attacker has actually broken the stream cipher. This is the case even if the attacker has any amount of chosen messages and corresponding icvs or performs any number of calculations.
29618653
An Algorithm for Calculating the Availability and Mean Time to Restore for Communication Through a Network
Abstract This paper presents algorithms for approximate calculation of the availability, Mean Time To Failure (MTTF) and Mean Time To Restore (MTTR) for communication through a network, as experienced by a certain origin-destination pair. The approximations should lead to quite minor errors, and in the case of the availability algorithm bounds on these errors are computed. The availability algorithm is similar to earlier algorithms [2], but the algorithm for calculating MTTF and MTTR is new as far as the authors are aware. In addition to presenting the calculation methods, a theory which predicts the computation time for the availability algorithm is developed and verified by comparison with the results of trials. The computation time for any algorithm for network availability must be expected to rise exponentially with the size of the network, but it has been found that in real networks, the values of network parameters are such that quite large networks can be analysed by the algorithm presented in this paper.
19675613
Near Optimal Unconditionally Secure Authentication
An efficient unconditionally secure authentication scheme with arbitration is presented which is also secure against attacks by the arbiter. Arguments are presented that suggest this scheme is almost optimal with respect to codeword lengths, and when many messages are sent the amount of key data per message approaches, at worst, 1/3 more than the best possible. An improved unconditionally secure authentication scheme without arbitration is also briefly presented.
33334239
Transputer communication link
Abstract The transputer communication link is a new standard for system interconnection. It uses the capabilities of VLSI to offer simple, easy-to-use and cheap interconnection for computer systems. This paper describes the transputer's communications link and the considerations which have influenced its design. The advantages of the link are shown in a conventional application. The link adaptor, which interfaces a communications link to the outside world, is introduced. Inmos makes two types of link adaptor. Each is described with example applications.
12238212
Taking a RaSP to Enterprise Stakeholder Dissonance
We present a model based approach to the resolution of conflict between the many stakeholders involved in large scale information system deployment and use. The work is based on the authors experience of more than $20B of outsourcing contracts. The approach, rapid scenario planning (RaSP) yields concrete evidence of the underlying assumptions that drive design and deployment, as well as critical insights into systems and business dynamics. Social and long term management and governance benefits are also obvious. Our implementation of the methodology is supported by specific tools, however equivalent general purpose tools can be used to support this methodology.
2332594
Automated data cache placement for embedded VLIW ASIPs
Memory bandwidth issues present a formidable bottleneck to accelerating embedded applications, particularly data bandwidth for multiple-issue VLIW processors. Providing an efficient ASIP data cache solution requires that the cache design be tailored to the target application. Multiple caches or caches with multiple ports allow simultaneous parallel access to data, alleviating the bandwidth problem if data is placed effectively. We present a solution that greatly simplifies the creation of targeted caches and automates the process of explicitly allocating individual memory access to caches and banks. The effectiveness of our solution is demonstrated with experimental results.
14799434
Effective Prediction and its Computational Complexity
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this particular formulation of the decision problem follows from the accuracy of its outputs in predicting the outputs of any particular deterministic process, and this predictability is quantified in terms of the number of bits the process may generate, and its length/time complexity. Both upper and lower bounds on the computational complexity of this decision problem are provided
636531
Design for test and the cost of quality
A generalized methodology is presented which can be used to select a cost effective design-for-test technique for use in the design process. The intent is to factor in both increased research and development costs as well as increased production costs. The authors also correlate the expected levels of test coverage. Thus, for a particular design, it is possible to predict the increase in cost of research and development, and increased production costs, and correlate this with test coverage. The tangible factors in the cost of quality can be determined.<<ETX>>