Differential attack on image encryption algorithm using binary bitplane

Image encryption using binary bitplane is first analyzed. Then based on the characteristic of the relationship between cipher image and plain image, equivalent key recovering algorithms for secrete permutation and subkey addition is proposed. Analysis and experimental results show the correctness and validity of the two equivalent key recovering algorithms. The data complexity of the attack for plain image P=_{(pi,j)M × N} is 1+log₂8MN, computational complexity is 2+ 2log₂8MN.