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

Computational complexity of modular exponentiation

 Home Mathematics Area of mathematics Number theory Modular arithmetic Modular exponentiation
 0 By others on same topic  0 Discussions  Updated 2025-05-29  +Created 1970-01-01  See my version
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 (6)

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

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  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