A Fast Decryption Algorithm for BSS-Based Image Encryption
The image encryption based on blind source separation (BSS) takes advantage of the underdetermined BSS problem to encrypt multiple confidential images. Its security can be further improved if the number of images to be simultaneously encrypted increases. However, the BSS decryption speed will correspondingly decrease since the computational load of the BSS algorithms usually has nonlinear relation with the number of the source signals. To solve the problem, this paper presents a fast decryption algorithm based on adaptive noise cancellation by using the knowledge of the key images, which are used in the BSS-based method and available at the receiving side. As a result, the number of the source signals for the fast BSS decryption is decreased in half, and the decryption time is considerably reduced. Both computer simulations and performance analyses demonstrate the efficiency of the proposed method.
KeywordsOriginal Image Independent Component Analysis Image Encryption Blind Source Separation Encrypt Image
Unable to display preview. Download preview PDF.
- 4.Cichocki, A., Amari, S.: Adaptive Blind Signal and Image Processing: Learning Algo-rithms and Applications. John Wiley, Chichester (2003)Google Scholar
- 5.Kasprzak, W., Cichocki, A.: Hidden Image Separation from Incomplete Image Mixtures by Independent Component Analysis. In: Proc. 13th Int. Conf. Pattern Recognition, II, pp. 394–398 (1996)Google Scholar
- 10.Haykin, S.: Adaptive Filter Theory. Prentice-Hall, Englewood Cliffs (1996)Google Scholar