OurBigBook
About
$
Donate
Sign in
+
Sign up
by
Ciro Santilli
(
@cirosantilli,
36
)
Computational complexity of modular exponentiation
Home
Mathematics
Area of mathematics
Number theory
Modular arithmetic
Modular exponentiation
0
Like
0 By others
on same topic
0 Discussions
Updated
2025-04-24
+
Created
1970-01-01
See my version
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
(6)
Modular exponentiation
Modular arithmetic
Number theory
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
+
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