Abstract
This paper presents a novel method for the parallelization of the modular multiplication algorithm in the Residue Number System (RNS). The proposed algorithm executes modular reductions using a new lookup table along with the Mixed Radix number System (MRS) and RNS. MRS is used because algebraic comparison is difficult in RNS, which has a non-weighted number representation. Compared with the previous algorithm, the proposed algorithm only requires L moduli which is half the number needed in the previous algorithm. Furthermore, the proposed algorithm reduces the number of MUL operations by 25 %.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Trans. on Info. Theory IT-22(6), 644–654 (1976)
Szabo, N.S., Tanaka, R.I.: Residue Arithmetic and Its Applications to Computer Technology. McGraw-Hill, New York (1967)
Taylor, F.J.: Residue Arithmetic: A Tutorial with Examples. Computer, 50–62 (May 1984)
Elleithy, K.M., Bayoumi, M.A.: A Systolic Architecture for Modulo Multiplication. IEEE Trans. on Circuits and Systems-II: Analog and Digital Signal Processing 42(11), 725–729 (1995)
Bajard, J.C., Didier, L.S., Kornerup, P.: An RNS Montgomery Modular Multiplication Algorithm. IEEE Trans. on Computers 47(7), 766–776 (1998)
Radhakrishnan, D., Yuan, Y.: Novel Approaches to the Design of VLSI RNS Multipliers. IEEE Trans. on Circuits and Systems-II: Analog and Digital Signal Processing 39(1), 52–57 (1992)
Alia, G., Martinelli, E.: A VLSI Modulo m Multiplier. IEEE Trans. on Computers 40(7), 873–878 (1991)
Taylor, F.J.: A VLSI Residue Arithmetic Multiplier. IEEE Trans. on Computers C-31(6), 540–546 (1982)
Jullien, G.A.: Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms. IEEE Trans. on Computers C-29(10), 899–905 (1980)
Soderstrand, M., Jenkins, W.K., Jullian, G.A., Taylor, F.J.: Residue Number Systems: Modern Applications in Digital Signal Processing. IEEE, New York (1986)
Dimitrov, V.S., Jullien, G.A., Miller, W.C.: A Residue Number System Implementation of Real Orthogonal Transforms. IEEE Trans. on Signal Processing 46(3), 563–570 (1998)
Kim, H.S., Lee, S.W., Yoo, K.Y.: Partitioned Systolic Multiplier for GF(2m). Information Processing Letter 76, 135–139 (2000)
Kim, H.S.: Bit-Serial AOP Arithmetic Architecture for Modular Exponentiation, Ph. D. Thesis, Kyungpook National Univ. (2002)
Halbutogullari, A., Koc, C.K.: Parallel Multiplication in GF(2k) using Polynomial Residue Arithmetic. Design, Codes and Cryptography 20(2), 155–173 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, HS., Park, HJ., Hwang, SH. (2004). Parallel Modular Multiplication Algorithm in Residue Number System. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_133
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_133
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive