In this paper we present a bit-oriented architecture for the digital Finite Impulse Response (FIR) filter with adaptive coefficients. Instead of using multipliers, the FIR operation is regarded as the summation of a larger number of operands. Our architecture utilizes two new word-level operand compressors, namely six-to-triple and six-to-double compressors. Both of these two compressors, multi...

The multiplicative inversion operation is a fundamental computation in several cryptographic applications. In this work, we propose a scalable VLSI hardware to compute the Montgomery modular inverse in GF(p). We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. We also propose an efficient hardware algorithm to c...

Horizontal collision correlation analysis (HCCA) imposes a serious threat to simple power analysis resistant elliptic curve cryptosystems involving unified algorithms, for e.g. Edward curve unified formula. This attack can be mounted even in presence of differential power analysis resistant randomization schemes. In this paper we have designed an effective countermeasure for HCCA protection, wh...

To determine the relative position of any two surfaces in a system, one approach is to use operations (Minkowski sum and intersection) on sets of constraints. These constraints are made compliant with half-spaces of n  where each set of half-spaces defines an operand polyhedron. These operands are generally unbounded due to the inclusion of degrees of invariance for surfaces and degrees of fre...

.text .global scalar_prod .type scalar_prod, @function .align 2 scalar_prod: stfs 2, -8(1) ; spill floating-point regs to stack memory stfs 1, -4(1) ; spill FPR1 stfs 4, -16(1) ; spill FPR4 stfs 3, -12(1) ; .... stfs 6, -24(1) stfs 5, -20(1) lwz 3, -8(1) ; load spilled FPR2 from stack to GPR3 lwz 4, -4(1) ; load spilled FPR1 from stack to GPR4 lwz 5, -16(1) ; .... lwz 6, -12(1) udi0fcm 3, 4, 3 ...

Combinatorial increases in programming productivity are possible by the introduction of high level operators and operands for composite data structures such as arrays, matrices, trees, record composites, etc. Such operators and operands can be composed to generate an infinite variety of virtual reusable components. However, the performance of the code resulting from such compositions is often i...

The main objective of this paper is to provide a solution for VLSI designers to design configurable Booth Multiplier that supports single 4-bit, single 8-bit, single 12-bit or single 16-bit multiplication. Multiplication is one of the basic functions used in digital signal processing for computation. Therefore, we need efficient algorithms to reduce the computations. Hence in order to minimize ...

Abstract Attacks that exploit memory errors are still a serious problem. We present data randomization, a new technique that provides probabilistic protection against these attacks by xoring data with random masks. Data randomization uses static analysis to partition instruction operands into equivalence classes: it places two operands in the same class if they may refer to the same object in a...

Commodity microprocessors contain more on-chip memory with each successive generation, and will contain tens of megabytes within the decade. We describe a novel architecture that runs an unmodified uniprocessor program across multiple nodes, each of which contains a processor tightly integrated with a sizable memory. The execution of instructions is replicated, while the access of operands is d...

Security issues play an important role in almost all modern communication and computer networks. The foundation of IT security are cryptographic systems, for example hyperelliptic curves cryptosystems (HECC). The advantage of HECC is that they allow encryption with shorter operands and at the same time, they provide the same level of security as other public-key cryptosystems, based on the inte...