In this paper, the problem of how to compute the characteristic spectrum for composition transformations over finite Abelian groups is solved, the concept of correlation coefficient of functions over finite Abelian groups is defined, and the problem of how to compute the correlation coefficient between a composition function and a linear function over finite field is solved, so the theoretic foundation of linear approximation to composition transformations in cryptography algorithm is established. |