At present

the algorithm of image scrambling degree evaluation has two problems. One is the instability of the evaluation result for the same scrambling algorithm

the other is the impossibility to evaluate many scrambling algorithms at the same time. In order to solve these two problems

a new evaluation algorithm for image scrambling is proposed based on analytic hierarchy process. At first

uniformity and randomness of scrambling matrix element distribution is calculated

thus

attribution values of scrambling pixels position distribution are acquired and the stability of the scrambling degree is guaranteed. Then

by applying analytic hierarchy process

the integration of two-dimensional attribution of scrambling degree and evaluation at the same time for many scrambling algorithms are implemented. Experiment results show that the scrambling degree of a scrambling algorithm is stabe and valid

it only relates with the algorithm itself and the number of iterations of the scrambling

and has nothing to do with the scrambling object. Meanwhile

the sorting of scrambling degrees for any number of scrambling algorithms is also established. The proposed algorithm is objective

fair and efficiency

it not only favors fast choosing suitable scrambling algorithm for the designer in information hiding field

but also provides powerful feedback tool for the development of scrambling algorithm.