OurBigBook
About
$
Donate
Sign in
+
Sign up
by
Ciro Santilli
(
@cirosantilli,
36
)
Modular arithmetic
Home
Mathematics
Area of mathematics
Number theory
0
Like
1 By others
on same topic
0 Discussions
Updated
2025-04-24
+
Created
1970-01-01
See my version
Table of contents
Modulo operation
Modular arithmetic
Modular multiplication
Modular arithmetic
Modular multiplicative inverse
Modular multiplication
Modular exponentiation
Modular arithmetic
Computational complexity of modular exponentiation
Modular exponentiation
Modulo operation
0
0
0
Modular arithmetic
Modular multiplication
0
0
0
Modular arithmetic
Modular multiplicative inverse
0
1
0
Modular multiplication
Modular exponentiation
0
1
0
Modular arithmetic
Can be calculated efficiently with the
Extended Euclidean algorithm
.
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
(4)
Number theory
Area of mathematics
Mathematics
Home
Incoming links
(2)
Finite field
GF(4)
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 arithmetic
by
Wikipedia Bot
0
1970-01-01
See all articles in the same topic
+
Create my own version