This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Modular exponentiation" – news · newspapers · books · scholar · JSTOR(February 2018) (Learn how and when to remove this message)
Modular exponentiation is exponentiation performed over a modulus. It is useful in computer science, especially in the field of public-key cryptography, where it is used in both Diffie–Hellman key exchange and RSA public/private keys.
Modular exponentiation is the remainder when an integer b (the base) is raised to the power e (the exponent), and divided by a positive integer m (the modulus); that is, c = be mod m. From the definition of division, it follows that 0 ≤ c < m.
For example, given b = 5, e = 3 and m = 13, dividing 53 = 125 by 13 leaves a remainder of c = 8.
Modular exponentiation can be performed with a negative exponent e by finding the modular multiplicative inverse d of b modulo m using the extended Euclidean algorithm. That is:
c = be mod m = d−e mod m, where e < 0 and b ⋅ d ≡ 1 (mod m).
Modular exponentiation is efficient to compute, even for very large integers. On the other hand, computing the modular discrete logarithm – that is, finding the exponent e when given b, c, and m – is believed to be difficult. This one-way function behavior makes modular exponentiation a candidate for use in cryptographic algorithms.
and 22 Related for: Modular exponentiation information
Modularexponentiation is exponentiation performed over a modulus. It is useful in computer science, especially in the field of public-key cryptography...
Algorithm (IDEA), and RC4. RSA and Diffie–Hellman use modularexponentiation. In computer algebra, modular arithmetic is commonly used to limit the size of...
In mathematics, exponentiation is an operation involving two numbers: the base and the exponent or power. Exponentiation is written as bn, where b is the...
square-and-multiply algorithms or binary exponentiation. These can be of quite general use, for example in modular arithmetic or powering of matrices. For...
is known. The relative cost of exponentiation. Though it can be implemented more efficiently using modularexponentiation, when large values of m are involved...
However, when performing many multiplications in a row, as in modularexponentiation, intermediate results can be left in Montgomery form. Then the initial...
Standard for digital signatures, based on the mathematical concept of modularexponentiation and the discrete logarithm problem. DSA is a variant of the Schnorr...
2 {\displaystyle 2} through p − 2 {\displaystyle p-2} and uses modularexponentiation to check whether a ( p − 1 ) / 2 ± 1 {\displaystyle a^{(p-1)/2}\pm...
are coprime. With that provision, x is the modular multiplicative inverse of a modulo b, and y is the modular multiplicative inverse of b modulo a. Similarly...
primality test. Both the provable and probable primality tests rely on modularexponentiation. To further reduce the computational cost, the integers are first...
respectively, hence testing them adds no value. Using fast algorithms for modularexponentiation and multiprecision multiplication, the running time of this algorithm...
Regardless of the specific algorithm used, this operation is called modularexponentiation. For example, consider Z17×. To compute 34 in this group, compute...
Gauss's introduction of modular arithmetic in 1801. Modulo (mathematics), general use of the term in mathematics Modularexponentiation Turn (angle) Mathematically...
Characterization of even perfect numbers Euler's theorem – Theorem on modularexponentiation Euler's partition theorem – Relates the product and series representations...
block and stream ciphers Modulo (mathematics) Modular arithmetic Modulo operation Modularexponentiation MOD., a science museum at the University of South...
Piyush Kurur and Ramprasad Saptharishi gave a similar algorithm using modular arithmetic in 2008 achieving the same running time. In context of the above...
Global Information