We describe a scalable and unified architecture for a Montgomery multiplication module which operates in both types of finite fields GF (p) and GF (2). The unified architecture requires only slightly more area than that of the multiplier architecture for the field GF (p). The multiplier is scalable, which means that a fixed-area multiplication module can handle operands of any size, and also, t...

All rings are commutative with identity and all modules are unitary. In this note we give some properties of a finite collection of submodules such that the sum of any two distinct members is multiplication, generalizing those which characterize arithmetical rings. Using these properties we are able to give a concise proof of Patrick Smith’s theorem stating conditions ensuring that the sum and ...

This work is devoted for the design and FPGA implementation of a 16bit Arithmetic module, which uses Vedic Mathematics algorithms. For arithmetic multiplication various Vedic multiplication techniques like Urdhva Tiryakbhyam Nikhilam and Anurupye has been thoroughly analyzed. Also Karatsuba algorithm for multiplication has been discussed. It has been found that Urdhva Tiryakbhyam Sutra is most ...

Invertibility of multiplication modules All rings are commutative with 1 and all modules are unital. Let R be a ring and M an R-module. M is called multiplication if for each submodule N of M, N=IM for some ideal I of R. Multiplication modules have recently received considerable attention during the last twenty years. In this talk we give the de nition of invertible submodules as a natural gene...

‎Let $S$ be an inverse semigroup with the set of idempotents $E$‎. We prove that the semigroup algebra $ell^{1}(S)$ is always‎ ‎$2n$-weakly module amenable as an $ell^{1}(E)$-module‎, ‎for any‎ ‎$nin mathbb{N}$‎, ‎where $E$ acts on $S$ trivially from the left‎ ‎and by multiplication from the right‎. ‎Our proof is based on a common fixed point property for semigroups‎.  

Let R be a commutative ring with identity and M be a unital R-module. Then M is called a multiplication module provided for every submodule N of M there exists an ideal I of R such that N = IM. Our objective is to investigate properties of prime and semiprime submodules of multiplication modules. Mathematics Subject Classification: 13C05, 13C13

A new algorithm is proposed for the software implementation of modular multiplication, which uses pre-computations with a constant module. The developed modular multiplication algorithm provides high performance in comparison with the already known algorithms, and is oriented at the variable value of the module, especially with the software implementation on micro controllers and smart cards wi...

We introduce Z-module structures which are extensions of additive loop structure and are systems 〈 a carrier, a zero, an addition, an external multiplication 〉, where the carrier is a set, the zero is an element of the carrier, the addition is a binary operation on the carrier, and the external multiplication is a function from Z× the carrier into the carrier. Let us mention that there exists a...

Let R be a commutative ring with identity and M an R–module. If M is either locally cyclic projective or faithful multiplication then M is locally either zero or isomorphic to R. We investigate locally cyclic projective modules and the properties they have in common with faithful multiplication modules. Our main tool is the trace ideal. We see that the module structure of a locally cyclic proje...

The double-precision floating-point arithmetic, specifically multiplication, is a widely used arithmetic operation for many scientific and signal processing applications. In general, the double-precision floating-point multiplier requires a large 53 × 53 mantissa multiplication in order to get the final result. This mantissa multiplication exists as a limit on both area and performance bounds o...