Discrete exponential function: Difference between revisions

Revision as of 18:22, 30 September 2014

Revision as of 18:25, 30 September 2014

Line 1:

We define a ≡ b (mod c) if (a - b)/c is an integer. TheDefine the function w = f(x, y, z) ≡ x^y (mod z), such that f ∈ {0, 1, ... , z - 1}. Then w = f(x, y, z) can be computed efficiently, even when x, y, z > 10³⁰⁰ by the following recursive algorithm (we assume that the integers x > 0, y > -1, and z > 0):

#if y = 0, return 1.

#if y is even, put u = f(x, y/2, z) and return (u*u) mod z