Neural Processing Letters

, Volume 24, Issue 2, pp 93–105 | Cite as

A Symmetric Probabilistic Encryption Scheme Based On CHNN Without Data Expansion

  • K. C. Leung
  • S. L. Li
  • L. M. Cheng
  • C. K. Chan


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.


cryptography encryption Hopfield network neural network virtual attractors 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Guo D.H., Cheng L.M., Cheng L.L. (1999). A new symmetric probabilistic encryption scheme based on chaotic attractors of neural networks. Applied Intelligence 10(1):71–84CrossRefGoogle Scholar
  2. 2.
    Hopfield J. (1982). Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences of the United States of America-Biological Sciences 79(8):2554–2558MathSciNetCrossRefGoogle Scholar
  3. 3.
    Gardner E. (1987). Maximum storage capacity in neural networks. Europhysics Letters 4(4):481–485ADSGoogle Scholar
  4. 4.
    Amit D., Gutfreund H., Sompolinsky H. (1987). Statistical-mechanics of neural networks near saturation. Annals of Physics 173(1): 30–67CrossRefADSGoogle Scholar
  5. 5.
    Chan C.K., Cheng L.M. (2001). The convergence properties of a clipped Hopfield and its application in the design of keystream generator. IEEE Transactions on Neural Networks 12(2):340–348CrossRefGoogle Scholar
  6. 6.
    McCulloch R., Pitts W. (1943). A logical calculus of the ideas immanet in nervous activity. Bulletin Mathematics Biophysics 5:115–133MATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Rivest R., Shamir A., Adleman L. (1978). Method for obtaining digital signatures and cryptosystems. Communications of the ACM 21(2):120–126MATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Paper, C. W.: Current public key cryptographic systems, ecc/wecc2.htm, (1997).Google Scholar
  9. 9.
    Golomb S.W. (1967). Shift Register Sequences. Holden-Day, San Francisco, CAMATHGoogle Scholar
  10. 10.
    Rueppel R. (1986). Linear complexity and random sequences. Lecture Notes in Computer Science 219:167–188MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer 2006

Authors and Affiliations

  • K. C. Leung
    • 1
  • S. L. Li
    • 1
  • L. M. Cheng
    • 1
  • C. K. Chan
    • 1
  1. 1.Department of Computer Engineering, Information TechnologyCity University of Hong KongHong KongChina

Personalised recommendations