We propose in the present paper a new algorithm, which needs almost no multiplication. We propose using modular arithmetic of the finite Galois field GF(Q) to map geometrical moments calculation to a fast Fourier-Mellin-Galois transform, which reduces the computational complexity from O(N4) to O(N2 log2 N). We illustrate the performance of the method by some classification and matching experiments.