By Topic

VLSI implementation of modulo multiplication using carry free addition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sarkar, P. ; Comput. Sci. Unit, Indian Stat. Inst., Calcutta, India ; Roy, B.K. ; Choudhury, P.P.

In this paper we show how the technique of carry free addition can be used to get efficient algorithms for modulo multiplication. We present two algorithms and their VLSI implementations. The first algorithm runs in time O(nlogn) (for n bit numbers), has an AT2 measure of O((nlogn)3), and can be implemented using a systolic architecture. The second algorithm is a parallel modulo algorithm that uses table look up to speed up computation. The time complexity is O(logn), the AT2 measure is O((n logn)2 ), and it can also be implemented using a systolic architecture. Used with a O(logn) multiplier, it can perform module multiplication in O(logn) time. Both the algorithms have the advantage that the circuit is independent of the modulus N. Thus the same chip can be used for RSA cryptosystems with different moduli

Published in:

VLSI Design, 1997. Proceedings., Tenth International Conference on

Date of Conference:

4-7 Jan 1997