In this article we show how the technique of carry free addition can be used to get efficient algorithms for modulo multiplication. We present two algorithms and their VLSI implementations. The first algorithm runs in time O(n\log n) (for n bit numbers), has an AT^2 measure of O((n\log n)^3), and can be implemented using a systolic architecture. The second algorithm is a parallel modulo algorithm that uses table look up to speed up computation. The time complexity is O(\log n), the AT^2 measure is O((n\,\log n)^2), and it can also be implemented using a systolic architecture. Used with a O(\log n) multiplier, it can perform modulo multiplication in O(\log n) time. Both the algorithms have the advantage that the circuit is independent of the modulus N. Thus the same chip can be used for RSA cryptosystems with different moduli.