By Topic

Modular multiplication in the residue number system with application to massively-parallel public-key cryptography systems

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

2 Author(s)
Freking, W.L. ; Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN, USA ; Parhi, K.K.

Modular multiplication is a fundamental operation in many public-key cryptography systems including RSA. Residue number system (RNS) implementation of modular multiplication has been of recent interest due to inherent RNS properties of multiplicative complexity reduction and digit independence over addition and multiplication. In this paper, a new RNS modular multiplication technique is introduced which relies solely upon modular arithmetic. The overhead formerly associated with such methods is rendered negligible, and the complexity roughly matches that of the most efficient mixed-arithmetic method. Application to massively-parallel systems is examined, revealing significant advantages over weighted number system counterparts.

Published in:

Signals, Systems and Computers, 2000. Conference Record of the Thirty-Fourth Asilomar Conference on  (Volume:2 )

Date of Conference:

Oct. 29 2000-Nov. 1 2000