Abstract
The paper introduces a new approach based on dual residue system to compute Montgomery multiplication. The novelty of this proposal is that we import an extra Montgomery residue system with new transformation constant beside the normal one. In this way, one of the multiplicand can be divided into two parts and both higher and lower parts are calculated in parallel to speed up computation. Then two implementations in hardware are proposed for the algorithm. In parallel architecture, the proposed algorithm can perform nearly twice speedup compared to normal Montgomery method. And in pipeline architecture, the computation speed can be even faster. Besides speeding up calculation the extra merit of our proposal is that the multiplier can partial replace Montgomery multiplier used nowadays without any changes on top architecture.
Chapter PDF
Similar content being viewed by others
References
Knuth, D.E.: The Art of Computer Programming — Seminumerical Algorithm, 3rd edn., vol. 2. Addison-Wesley, Reading (1998)
Barrett, P.: Implementing the Rivest Shamir and Adleman public key encryption algorithm on astandard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311–323. Springer, Heidelberg (1987)
Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Trans. Infomation Theory 22(11), 644–654 (1976)
Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation 44(170), 519–521 (1985)
Kaihara, M.E., Takagi, N.: Bipartite Modular Multiplication. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 201–210. Springer, Heidelberg (2005)
McLoone, M., McIvor, C., McCanny, J.V.: Coarsely integrated operand scanning (CIOS) architecture for high-speed Montgomery modular multiplication. In: ICFPT 2004. IEEE International Conference on Field-Programmable Technology, pp. 185–191 (2004)
Walter, C.D.: Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition. IEEE Trans. Computers 46(2) (1997)
Manochehri, K., Pourmozafari, S.: Modified radix-2 Montgomery modular multiplication to make it faster and simpler. In: ITCC 2004. International Conference on Information Technology: Coding and Computing, vol. 1, pp. 598–602 (2005)
Koç, Ç.K., Acar, T., Kaliski Jr., B.S.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16(3), 26–33 (1996)
Chiou-Yng, L., Jenn-Shyong, H., I-Chang, J., Erl-Huei, L.: Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2m). IEEE Trans. Computers 54(9), 1061–1070 (2005)
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commum. ACM 21(2), 120–126 (1978)
Hars, L.: Long Modular Multiplication for Cryptographic Applications. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 45–61. Springer, Heidelberg (2004)
Yanik, T., Savas, E., Koç, Ç.K.: Incomplete reduction in modular arithmetic. IEE Proceedings-Computers and Digital Techniques 149(2), 46–52 (2002)
IEEE Standard Specifications for Public-Key Cryptography, IEEE Std 1363-2000 (2000)
Tawalbeh, L.A., Tenca, A.F., Koç, Ç.K.: A radix-4 scalable design. IEEE Potentials 24(2), 16–18 (2005)
Tenca, A.F., Koç, Ç.K.: A Scalable Architecture for Modular Multiplication Based on Montgomery’s Algorithm. IEEE Trans. Computers 52(9) (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wang, A., Jin, Y., Li, S. (2007). Dual-Residue Montgomery Multiplication. In: Li, K., Jesshope, C., Jin, H., Gaudiot, JL. (eds) Network and Parallel Computing. NPC 2007. Lecture Notes in Computer Science, vol 4672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74784-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-74784-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74783-3
Online ISBN: 978-3-540-74784-0
eBook Packages: Computer ScienceComputer Science (R0)