Modular multiplication and exponentiation are common operations in modern cryptography. Unification problems with respect to some equational theories that these operations satisfy are investigated. Two different but related equational theories in which the (one-sided) distributivity property of exponentiation over multiplication is assumed are analyzed. The unifiability problem is shown to be undecidable for these two theories.