Composite Image Encryption Algorithm Based On Matrix Transformation

In the context of large data,the concept of "Internet+" has been proposed,triggering a new wave of Internet communication,and this field enters a new stage.In the age of large data information,the convenience of information circulation is realized.However,under the premise of obtaining a lot of information,a series of image security problems appear,making the research and development of image security more and more urgent.In the storage and transmission of images,users need to pay more attention to the security and confidentiality of images.Therefore,image encryption technology becomes an important branch in the field of communication security.This thesis mainly studies the composite image encryption method based on matrix transformation:Firstly,the definitions of the centro-invertible matrix and the involutory matrix over ring are given,and the related properties are studied.On this basis,a kind of method for constructing high order centro-invertible matrix is proposed for image encryption.The involutory matrix is obtained from the centro-invertible matrix transformation and applied to image encryption.The methods are more efficient.Secondly,an image encryption method based on information hiding is proposed to reduce the identification resolution of encrypted images.The results show that there is tiny visual difference between the stego-images and the cover-images,which reduces the probability of potential attackers finding effective attack information.In order to further increase the security level,a comprehensive encryption scheme is proposed,which includes matrix transformation,information hiding and image sharing.The experiment shows that the scheme has strong capability of anti-attack and data backup.Finally,the definition of the {K,s+1}-potent matrix over ring is given,and the related properties are studied.Based on this kind of matrix,a new image encryption method is proposed,which effectively extends the matrix transform encryption method.