A New Symmetric Probabilistic Encryption Scheme Based on Chaotic Attractors of Neural Networks

A new probabilistic symmetric-key encryption scheme based on chaotic-classified properties of Hopfield neural networks is described. In an overstoraged Hopfield Neural Network (OHNN) the phenomenon of chaotic-attractors is well documented and messages in the attraction domain of an attractor are unpredictably related to each other. By performing permutation operations on the neural synaptic matrix, several interesting chaotic-classified properties of OHNN were found and these were exploited in developing a new cryptography technique. By keeping the permutation operation of the neural synaptic matrix as the secret key, we introduce a new probabilistic encryption scheme for a symmetric-key cryptosystem. Security and encryption efficiency of the new scheme are discussed.

[1]  Gilles Brassard,et al.  Modern cryptology , 2006 .

[2]  Jennifer Seberry,et al.  Cryptography - an introduction to computer security , 1991, Advances in computer science series.

[3]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Lee-Ming Cheng,et al.  Configurable nonlinear filter generator , 1998 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Marco Tomassini,et al.  Cryptography with cellular automata , 2001, Appl. Soft Comput..

[7]  Santosh S. Venkatesh,et al.  The capacity of the Hopfield associative memory , 1987, IEEE Trans. Inf. Theory.

[8]  James L. Massey,et al.  A spectral characterization of correlation-immune combining functions , 1988, IEEE Trans. Inf. Theory.

[9]  D. Amit,et al.  Statistical mechanics of neural networks near saturation , 1987 .

[10]  W S McCulloch,et al.  A logical calculus of the ideas immanent in nervous activity , 1990, The Philosophy of Artificial Intelligence.

[11]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[12]  Toshinobu Kaneko,et al.  Dynamic Swapping Schemes and Differential Cryptanalysis (Special Section on Information Theory and Its Applications) , 1994 .

[13]  E. Gardner,et al.  Maximum Storage Capacity in Neural Networks , 1987 .

[14]  Sommers,et al.  Chaos in random neural networks. , 1988, Physical review letters.

[15]  John J. Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities , 1999 .

[16]  Martin E. Hellman,et al.  On the security of multiple encryption , 1981, CACM.

[17]  Martin E. Hellman,et al.  An extension of the Shannon theory approach to cryptography , 1977, IEEE Trans. Inf. Theory.

[18]  Stephen Wolfram.  Cryptography with Cellular Automata , 1985, CRYPTO.

[19]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[20]  Rainer A. Rueppel,et al.  Products of linear recurring sequences with maximum complexity , 1987, IEEE Trans. Inf. Theory.

[21]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[22]  Eli Biham,et al.  Differential cryptanalysis of DES-like cryptosystems , 1990, Journal of Cryptology.