Modular multiplication is a key operation in public key cryptosystems like RSA. Among modular multiplication methods, Montgomery modular multiplication is an efficient algorithm suitable for hardware implementation. In this paper, a Modified Montgomery Modular Multiplication design is proposed with carry save adder architecture and parallel simplified quotient computation for the next iteration...

The technique for hardware multiplication based upon Fourier transformation has been introduced. The technique has the highest efficiency on multiplication units with up to 8 bit range. Each multiplication unit is realized on base of the minimized Boolean functions. Experimental data showed that this technique the multiplication process speed up to 20% higher for 2 − 8 bit range of input operan...

Secure communication is a challenging issue in modern industries and critical infrastructures. The core technology used for securing the communication is cryptography. Modular multiplication is an important operation in cryptosystems. This paper investigates a novel modular multiplication algorithm and architecture. In the proposed algorithm and architecture, the parallel architecture and compa...

The availability of a new carry-less multiplication instruction in the latest Intel desktop processors significantly accelerates multiplication in binary fields and hence presents the opportunity for reevaluating algorithms for binary field arithmetic and scalar multiplication over elliptic curves. We describe how to best employ this instruction in field multiplication and the effect on perform...

In this paper, a novel technique for multiplication is presented using Vedic multiplier. Vedic multiplier uses adders and hence making fast adder will increase the overall speed for multiplication. We have done comparative analysis for multiplication using different architectures of adder. For comparison we have taken Carry Select Adder (CSA), Square Root Carry Select Adder (SQRT-CSA). We have ...

X and Y in multiple different ways as long as the matrix multiplication remains valid. For example, we could assign the multiplication modes in both tensors to columns, in this case the matrix product becomes Z = XY . Alternatively, the tensor Y could be matrisized with the multiplication modes corresponding to rows, resulting in the product Z = XY. In a series of tensor multiplications the ord...

We describe a method to determine all the isomorphism classes of principal polarizations of the modular abelian surfaces Af with quaternionic multiplication attached to a normalized newform f without complex multiplication. We include an example of Af with quaternionic multiplication for which we find numerically a curve C whose Jacobian is Af up to numerical approximation, and we prove that it...

‎Let $mathcal{A}$ be a commutative Banach algebra and $mathscr{X}$ be a left Banach $mathcal{A}$-module‎. ‎We study the set‎ ‎${rm Dec}_{mathcal{A}}(mathscr{X})$ of all elements in $mathcal{A}$ which induce a decomposable multiplication operator on $mathscr{X}$‎. ‎In the case $mathscr{X}=mathcal{A}$‎, ‎${rm Dec}_{mathcal{A}}(mathcal{A})$ is the well-known Apostol algebra of $mathcal{A}$‎. ‎We s...

N-methyl-pyridinium formate, a novel component of coffee extracts, inhibited the multiplication of both DNA and RNA viruses. In the presence of the compound, the progeny viral yields of both herpes simplex virus type 1 (HSV-1) and poliovirus in HEp-2 cells and those of influenza virus type A in MDCK cells decreased with increasing concentrations of the compound, although the degree of viral sen...

Matrix multiplication is widely used in a variety of applications and is often one of the core components of many scientific computations which includes graph theory, numerical methods, digital control and signal processing. Multiplication of large matrices require a lot of computation time as its complexity is O(n), where n is the dimension of the matrix. A serial algorithm to compute large ma...