An analytic expression for the lower bound on the complexity of residue multiplication is developed. Significant reduction of the required stored logic in a content-addressable memory is noted. Errors in Figs. 5(a), 7, and 8 of the above paper' are corrected. Index Terms -Addition-and multiplication mod M, complexity of residue addition and multiplication, content-addressable memory, optimal re...

In look-up table based multiplication schemes, techniques based on tables of squares require less memory than techniques based on direct implementations. In this paper, we present a method to realize an n-bit multiplier using a table of squares for n-bit integers. A new technique to store tables of squares is also presented. The new scheme is shown to compare favorably, in terms of storage requ...

Corresponding Author: Mohsen Bafandehkar Department of Computer Science, University Putra Malaysia, Selangor, Malaysia Email: [email protected] Abstract: The most expensive and time-consuming operation in Elliptic curve cryptosystem is scalar multiplication operation. Optimization of scalar multiplication will substantially enhance the ECC performance. Scalar multiplication can be improved ...

we examine the symplectic group $sp_{2m}(q)$ and its correspondingaffine subgroup. we construct the affine subgroup and show that itis a split extension. as an illustration of the above we study theaffine subgroup $2^5{:}sp_4(2)$ of the group $sp_6(2)$.

In this paper, we determine all of subgroups of symmetric group S4 by applying Lagrange theorem and Sylow theorem. First, we observe the multiplication table of S4, then we determine all possibilities of every subgroup of order n, with n is the factor of order S4. We found 30 subgroups of S4. The diagram of lattice subgroups of S4 is then presented. Mathematics Subject Classification: 20B30, 20...