OurBigBook About$ Donate
 Sign in+ Sign up
by Ciro Santilli (@cirosantilli, 37)

Modular exponentiation

 Home Mathematics Area of mathematics Number theory Modular arithmetic
 1 By others on same topic  0 Discussions  Updated 2025-05-26  +Created 1970-01-01  See my version
Can be calculated efficiently with the Extended Euclidean algorithm.
  • Table of contents
    • Computational complexity of modular exponentiation Modular exponentiation

Computational complexity of modular exponentiation

 0  0 
Modular exponentiation
math.stackexchange.com/questions/2382011/computational-complexity-of-modular-exponentiation-from-rosens-discrete-mathem mentions:
bnmodm
(1)
can be calculated in:
log(m)2log(n)
(2)
Remember that log(m) and log(n) are the lengths in bits of m and n, so in terms of the length in bits M and N we'd get:
M2N
(3)

 Ancestors (5)

  1. Modular arithmetic
  2. Number theory
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (3)

  • Diffie-Hellman key exchange
  • Discrete logarithm of the cyclic group
  • RSA (cryptosystem)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Modular exponentiation by Wikipedia Bot 0  1970-01-01
 Read the full article
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook