Nonnegative Matrix Factorization Applied to Nonlinear Speech and Image Cryptosystems

Nonnegative matrix factorization (NMF) is widely used in signal separation and image compression. Motivated by its successful applications, we propose a new cryptosystem based on NMF, where the nonlinear mixing (NLM) model with a strong noise is introduced for encryption and NMF is used for decryption. The security of the cryptosystem relies on following two facts: 1) the constructed multivariable nonlinear function is not invertible; 2) the process of NMF is unilateral, if the inverse matrix of the constructed linear mixing matrix is not nonnegative. Comparing with Lin's method (2006) that is a theoretical scheme using one-time padding in the cryptosystem, our cipher can be used repeatedly for the practical request, i.e., multitme padding is used in our cryptosystem. Also, there is no restriction on statistical characteristics of the ciphers and the plaintexts. Thus, more signals can be processed (successfully encrypted and decrypted), no matter they are correlative, sparse, or Gaussian. Furthermore, instead of the number of zero-crossing-based method that is often unstable in encryption and decryption, an improved method based on the kurtosis of the signals is introduced to solve permutation ambiguities in waveform reconstruction. Simulations are given to illustrate security and availability of our cryptosystem.

[1]  Terrence J. Sejnowski,et al.  Learning Overcomplete Representations , 2000, Neural Computation.

[2]  Andrzej Cichocki,et al.  Robust neural networks with on-line learning for blind identification and blind separation of sources , 1996 .

[3]  Pierre Comon,et al.  Independent component analysis, A new concept? , 1994, Signal Process..

[4]  Andrzej Cichocki,et al.  Adaptive Blind Signal and Image Processing - Learning Algorithms and Applications , 2002 .

[5]  M. B. Srinivas,et al.  Speech encoding and encryption in VLSI , 2003, ASP-DAC '03.

[6]  C. Caiafa,et al.  Separation of statistically dependent sources using an L 2 -distance non-Gaussianity measure , 2006 .

[7]  Hualou Liang,et al.  A blind source separation-based method for multiple images encryption , 2008, Image Vis. Comput..

[8]  Daniel W. C. Ho,et al.  Underdetermined blind source separation based on sparse representation , 2006, IEEE Transactions on Signal Processing.

[9]  Yuanqing Li,et al.  Probability estimation for recoverability analysis of blind source separation based on sparse representation , 2006, IEEE Transactions on Information Theory.

[10]  Jun Cheng,et al.  Wavelet transform-based analogue speech scrambling scheme , 1996 .

[11]  Carlos G. Puntonet,et al.  Post-nonlinear blind source separation using methaheuristics , 2003 .

[12]  Yeng Chai Soh,et al.  Chaotic cryptosystem with high sensitivity to parameter mismatch , 2003 .

[13]  Zhaoshui He,et al.  A Note on Stone's Conjecture of Blind Signal Separation , 2005, Neural Computation.

[14]  Shahram Etemadi Borujeni,et al.  Speech encryption based on fast Fourier transform permutation , 2000, ICECS 2000. 7th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.00EX445).

[15]  Sen Jia,et al.  Improved Stone’s Complexity Pursuit for Hyperspectral Imagery Unmixing , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[16]  Vwani P. Roychowdhury,et al.  Independent component analysis based on nonparametric density estimation , 2004, IEEE Transactions on Neural Networks.

[17]  Lin Qiuhua,et al.  Image cryptosystems based on blind source separation , 2003, International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003.

[18]  Stephen M. Matyas,et al.  Generating user-based cryptographic keys and random numbers , 1999, Comput. Secur..

[19]  L. Finesso,et al.  Nonnegative matrix factorization and I-divergence alternating minimization☆ , 2004, math/0412070.

[20]  Aapo Hyvärinen,et al.  Fast and robust fixed-point algorithms for independent component analysis , 1999, IEEE Trans. Neural Networks.

[21]  Jacek M. Zurada,et al.  Nonlinear Blind Source Separation Using a Radial Basis Function Network , 2001 .

[22]  Andrzej Cichocki,et al.  New Algorithms for Non-Negative Matrix Factorization in Applications to Blind Source Separation , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[23]  John G. McWhirter,et al.  Blind Signal Separation on Real Data: Tracking and Implementation , 2006, ICA.

[24]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[25]  Yuanqing Li,et al.  Analysis of Sparse Representation and Blind Source Separation , 2004, Neural Computation.

[26]  Hualou Liang,et al.  A blind source separation based method for speech encryption , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[27]  Fu-Liang Yin,et al.  Blind source separation applied to image cryptosystems with dual encryption , 2002 .

[28]  Patrik O. Hoyer,et al.  Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..

[29]  Vishal Monga,et al.  Robust and Secure Image Hashing via Non-Negative Matrix Factorizations , 2007, IEEE Transactions on Information Forensics and Security.

[30]  Fabian J. Theis,et al.  Sparse component analysis and blind source separation of underdetermined mixtures , 2005, IEEE Transactions on Neural Networks.

[31]  Ruey-Wen Liu,et al.  General approach to blind source separation , 1996, IEEE Trans. Signal Process..

[32]  Andrzej Cichocki,et al.  Nonnegative matrix factorization with constrained second-order optimization , 2007, Signal Process..

[33]  Lai-Wan Chan,et al.  Enhancement of Source Independence for Blind Source Separation , 2006, ICA.

[34]  G. V. Anand,et al.  Speech encryption using circulant transformations , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[35]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[36]  Lin-Shan Lee,et al.  A General Theory for Asynchronous Speech Encryption Techniques , 1986, IEEE J. Sel. Areas Commun..