Modular exponentiation is the cornerstone computation in public key cryptography systems such as RSA cryptosystems .The operation is time consuming for large operands. This paper describes the characteristics of three architectures designed to implement modular exponentiation using the fast binary method: the first field programmable gate array (FPGA) prototype has a sequential architecture, th...

The out-of-order issue queue (IQ), used in modern superscalar processors is a considerable source of energy dissipation. We consider design alternatives that result in significant reductions in the power dissipation of the IQ (by as much as 75%) through the use of comparators that dissipate energy mainly on a tag match, 0-B encoding of operands to imply the presence of bytes with all zeros and,...

A notation is developed which permits space and time efficiemcy comparisons of four basic computer architectures in use today for executing Fortran-style assignment statements. From the com~arisona, we discover that a suitably designed l-address archit.cture (one accumulator machine) outperforms toe other architectures in speed of execution and in encoded size ~ compiled Fortran statements. The...

This paper describes the processing and transformation of medical data from a clinical database to a statistical data matrix. Precise extraction and linking tools must be available for the desired data to be processed for statistical purposes. We show that flexible mechanisms are required for the different types of users, such as physicians and statisticians. In our retrieval tools we use logic...

Bialgebras and their specialisation Hopf algebras are algebraic structures that challenge traditional mathematical notation, in that they sport two core operations that defy the basic functional paradigm of taking zero or more operands as input and producing one result as output. On the other hand, these peculiarities do not prevent studying them using rewriting techniques, if one works within ...

Fraction reduction is a basic computation for rational numbers. P system is a new computing model, while the current methods for fraction reductions are not available in these systems. In this paper, we propose a method of fraction reduction and discuss how to carry it out in cell-like P systems with the membrane structure and the rules with priority designed. During the application of fraction...

In regular FIR structure, by pipelining the multipliers one can improve the throughput. But as the growth of operand word length, the delay in addition process becomes another important constraint. In this paper, a novel fine-grain pipelining scheme for high throughput FIR is proposed. By pipelining multipliers and adders, very high throughput can be achieved. 2-Dimensional pipeline gating tech...

We describe how a simple way to split input operands allows for fast VLSI implementations of subquadratic GF (2)[x] Karatsuba-Ofman multipliers. The theoretical XOR gate delay of the resulting multipliers is reduced significantly. For example, it is reduced by about 33% and 25% for n = 2 and n = 3 (t > 1), respectively. To the best of our knowledge, this parameter has never been improved since ...

We study arithmetic properties of a new treebased number representation, Recursively run-length compressed natural numbers, defined by applying recursively a run-length encoding of their binary digits. Our representation supports novel algorithms that, in the best case, collapse the complexity of various computations by superexponential factors and in the worse case are within a constant factor...

Modular arithmetic is fundamental to several public-key cryptography systems such as the RSA encryption system, as well as the most dominant part of the computation performed. The operation is time-consuming for large operands. Many relevant papers about computer security are issued in many reports and journals to describe how to reduce the computational complexities in the cryptosystems. In th...