The operand that the mod operation is computed with respect to. For instance, in the congruence \(a \equiv b \bmod n\), the value n is the modulus. In RSA public-key encryption and the RSA digital signature scheme, the modulus is the integer that is the product of two large primes.
See modular arithmetic.
This is a preview of subscription content, log in via an institution to check access.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this entry
Cite this entry
Contini, S. (2005). Modulus. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_261
Download citation
DOI: https://doi.org/10.1007/0-387-23483-7_261
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23473-1
Online ISBN: 978-0-387-23483-0
eBook Packages: Computer ScienceReference Module Computer Science and Engineering