3.2 One-Way Functions

f (x) is relatively simple thing to do, but to inverse the procedure is much more difficult;

that is, given a remainder to find the value x which was orginally cubed. This procedure

is referred to as the computation of a modular cube root with mo dulus n. If the factors

of n are unknown and large, this is a di cult problem; however, if the factors p and q of

n are known then there is an e cient algorithm for computing modular cube roots.