Abstract
Modular exponentiation is the computation of x e mod m, and multiplicative modular inversion is the computation of y such that x ∗ y mod m = 1. This chapter consists of two sections, one each on the two operations. Modular division is included implicitly in the second, as in practice it is effected as multiplication by an inverse.
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
Similar content being viewed by others
References
D. E. Knuth. 1998. The art of Computer Programming, Vol.
2. Addison-Wesley, Reading, Massachusetts, U.S.A.N. Nedjah and L. M. Mourelle. 2006. Three hardware architectures for the binary modular exponentiation: sequential, parallel, and systolic. IEEE Transactions on Circuits and Systems I: Regular Papers, 53(3):27–633.
A. Reza and P. Keshavarzi. 2015. High-throughput modular multiplication and exponentiation algorithms using multibit-scan–multibit-shift technique. IEEE Transactions on Very Large Scale Integration (VLSI) Systems , 23(9):1710–1719.
F. Gandino, F. Lamberti, G. Paravati, J.-C. Bajard, and P. Montuschi. 2012. An algorithmic and architectural study on Montgomery exponentiation in RNS. IEEE Transactions on Computers, 61(8):1071–1083.
H. Orup and P. Kornerup. 1991. A high-radix hardware algorithm for calculating the exponential M E modulo N. Proceedings, 10th IEEE Symposium on Computer Arithmetic, pp. 51–56.
J. Stein. 1961. Computational problems associated with Racah algebra. Journal of Computational Physics, 1:397–405.
Takagi, N.: 1998. A VLSI algorithm for modular division based on the binary GCD algorithm. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E81-A(5):724–728.
T. Zhou, X. Wu, G. Bai, and H. Chen. 2002. Fast GF(p) modular inversion algorithm suitable for VLSI implementation. Electronics Letters, 38(1):706–707.
L. Hars. 2006. Modular inverse algorithms without multiplications for cryptographic applications. EURASIP Journal on Embedded Systems, 1:1–13.
P. Choi, M. K. Lee, J. T. Kong, and D. K. Kim. 2017. Efficient design and performance analysis of a hardware right-shift binary modular inversion algorithm in GF(p). Journal of Semiconductor Technology and Science, 17(3):425–437
2. Addison-Wesley, Reading, Massachusetts, U.S.A.Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
R. Omondi, A. (2020). Modular Exponentiation, Inversion, and Division. In: Cryptography Arithmetic. Advances in Information Security, vol 77. Springer, Cham. https://doi.org/10.1007/978-3-030-34142-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-34142-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34141-1
Online ISBN: 978-3-030-34142-8
eBook Packages: Computer ScienceComputer Science (R0)