vimwiki/tech/modular_exponentiation.wiki

13 lines
290 B
Plaintext

= Modular Exponentiation =
Modular Exponentation applies to problems of the format
a^b mod n
often when a^b becomes some very large number. This is a common problem to
solve in computer science, espeically cryptography.
Two things to keep in mind
- (x^a)^s = x^2a
- x^(a+b) = x^a * x^b