Bringing numbers in and out of Montgomery Representation can be made into an encrypting operation by using P, PQ as private and public moduli, with P and Q chosen as large primes. This makes adding, multiplying together ciphertext possible and of feasible complexity (given that you don't need to perform divisions form).

Few understand this.