A symmetric probabilistic encryption scheme based on CHNN without data expansion

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal

8 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)93-105
Journal / PublicationNeural Processing Letters
Volume24
Issue number2
Publication statusPublished - Oct 2006

Abstract

In 1999, Guo et al. proposed a new probabilistic symmetric probabilistic encryption scheme based on chaotic attractors of neural networks. The scheme is based on chaotic properties of the Overstoraged Hopfield Neural Network (OHNN). The approach bridges the relationship between neural network and cryptography. However, there are some problems in their scheme: (1) exhaustive search is needed to find all the attractors; (2) the data expansion in the paper is wrongly derived; (3) problem exists on creating the synaptic weight matrix. In this letter, we propose a symmetric probabilistic encryption scheme based on Clipped Hopfield Neural Network (CHNN), which solves the above mentioned problems. Furthermore, it keeps the length of the ciphertext equals to that of the plaintext. © Springer Science+Business Media, LLC 2006.

Research Area(s)

  • Cryptography, Encryption, Hopfield network, Neural network, Virtual attractors