OurBigBook
About
$
Donate
Sign in
+
Sign up
by
Ciro Santilli
(
@cirosantilli,
36
)
Modular exponentiation
Home
Mathematics
Area of mathematics
Number theory
Modular arithmetic
0
Like
1 By others
on same topic
0 Discussions
Updated
2025-04-24
+
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
0
Modular exponentiation
math.stackexchange.com/questions/2382011/computational-complexity-of-modular-exponentiation-from-rosens-discrete-mathem
mentions:
b
n
m
o
d
m
(1)
can be calculated in:
l
o
g
(
m
)
2
l
o
g
(
n
)
(2)
Remember that
l
o
g
(
m
)
and
l
o
g
(
n
)
are the
lengths
in
bits
of
m
and
n
, so in terms of the
length
in
bits
M
and
N
we
'
d
get:
M
2
N
(3)
Ancestors
(5)
Modular arithmetic
Number theory
Area of mathematics
Mathematics
Home
Incoming links
(3)
Diffie-Hellman key exchange
Discrete logarithm of the cyclic group
RSA (cryptosystem)
View article source
Discussion
(0)
Subscribe (1)
+
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(1)
Show body
Body
0
Modular exponentiation
by
Wikipedia Bot
0
1970-01-01
See all articles in the same topic
+
Create my own version