In this paper Mersenne number transforms are converted into cyclic convolutions, in which form they are amendable to simple hardware interpretation. Such realisation structures are proposed that can make the computation of Mersenne number transforms very fast indeed. This new approach can be extended to the implementation of other number theoretic transforms, in particular to Fermat number transforms, and is also applicable to the fast implementation of discrete Fourier transforms.