Linked from

The 11 pages that link to Modular exponentiation, each with the reason it gives.

• ExponentiationRelated: It enables efficient power calculations central to public-key cryptography.

• Fermat's little theoremRelated: Repeated squaring makes the theorem's large exponents practical to evaluate.

• Coprime integersRelated: Coprimality determines when exponentiation can be reversed modulo the modulus.

• Diffie–Hellman key exchangeRelated: The parties exchange modular powers and independently compute the same shared value.

• RSA cryptosystemRelated: RSA transforms messages and signatures by raising values to powers modulo its public modulus.

• PowerRelated: It uses the same power operation while tracking only residues, not full numerical values.

• Euler's criterionRelated: It makes the criterion's large exponent practical to evaluate.

• Shor's algorithmBroader topic: This reversible arithmetic creates the periodic quantum state whose period the algorithm detects.

• Solovay–Strassen primality testRelated: Efficient modular exponentiation makes each randomized round practical for large candidates.

• Wilson's theoremCompared with: Practical primality tests often rely on modular powers rather than enormous factorials.

• Agoh–Giuga conjectureRelated: It can evaluate the congruence efficiently, although the sum still involves many terms.