Efficient Partial Product Generation using Radix4 & Radix8 for Multi-Modulus Multiplication

نویسنده

  • Priya Sandhu
چکیده

Now a day’s multiplication and modulus takes crucial role so we are combining multiplication and modulus. A Novel multi-modulus multiplier with different widths of modulus operations. In this paper we have radix4 multi-modulus multiplier with 4bit, 32bit, 64bit and radix8 multi-modulus multiplier with 4bit, 32bit, 64bit.radix4 and radix8 multi-modulus multiplier using Residue multiplication is implemented by using xilix13.2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Implementation of Compact Booth Multiplier for Low power, Low Area & High Speed Applications

Presently, the design of a compact multiplier is playing a vital role in the stream of VLSI signal processing, DSP, Modern wireless communication etc. The main goal of this proposal is to design a compact booth multiplier by using modified radix4 recoding and an efficient finite state machine (FSM) to achieve small chip size and low delay utilization. In the existing technique, compression base...

متن کامل

Iterative modular multiplication algorithm without magnitude comparison - Electronics Letters

A fast iterative modular multiplication algorithm is proposed for modular exponentiation with a large modulus, such as the RSA cryptosystem. The limit on partial products is raised to become less than 2” instead of modulus N with n-bit length. The naturally generated carry signifies when the computed partial product is greater than or equal to 2”. and a subtraction is subsequently performed. No...

متن کامل

Efficient dot product over word-size finite fields

We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range of implementation techniques using different representations. The techniques used include floating point representations, discrete logarithms, tabulations, Montgomery reduction, delayed modulus.

متن کامل

An Efficient Baugh-Wooley Multiplication Algorithm for 32-bit Synchronous Multiplication

This paper presents an efficient implementation of a high speed 32-bit synchronous Baugh-Wooley multiplier using the Brent-Kung. BW multiplier involves basic operations of generation of partial product and their accumulation. As a result of which they occupy less area and provides fast speed as compared to the serial multiplier. This is very important criteria because in the fabrication of chip...

متن کامل

A Binary Redundant Scalar Point Multiplication in Secure Elliptic Curve Cryptosystems

The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is performed in the top level of GF (Galois Field) multiplication and GF division, has been the double-andadd algorithm, which is being recently challenged by NAF (Non-Adjacent Format) algorithm. In this paper, we propose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015