Abstract
This paper describes an improvement over Montgomery Modular Multiplication proposed by Peter L. Montgomery in [1]. Montgomery in [1] has proposed a method of computing \(z = x.y \, mod \, N\) (\(N > 1\)) which is much faster and does not require any division by N. Central to his method is one algorithm called Reduction algorithm which is required to be employed 4 times in order to compute z. The improvement that we propose still uses the same Reduction algorithm of [1], but in the improved version we are only required to employ the Reduction algortihm twice in order to compute z.
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
References
Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519–521 (1985)
Quisquater, J.J., Couvreur, C.: Fast decipherment algorithm for RSA public-key cryptosystem. IEE Electron. Lett. 18(21), 905907 (1982)
Rivest, R.L., Shamir, A., Adlemn, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120–126 (1978)
BigDigits multiple-precision arithmetic source code. http://www.di-mgt.com.au/bigdigits.html
Acknowledgment
We thank the referee of this paper for the helpful comments. It improved the presentation of the paper.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Mukhopadhyay, D. (2021). Improvement over Montgomery Modular Multiplication. In: Tripathy, S., Shyamasundar, R.K., Ranjan, R. (eds) Information Systems Security. ICISS 2021. Lecture Notes in Computer Science(), vol 13146. Springer, Cham. https://doi.org/10.1007/978-3-030-92571-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-92571-0_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92570-3
Online ISBN: 978-3-030-92571-0
eBook Packages: Computer ScienceComputer Science (R0)