International Journal of Computer Theory and Engineering

Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJCTE 2010 Vol.2(4): 665-669
doi: 10.7763/IJCTE.2010.V2.220

Private Inputs to Tree Parity Machine

Pravin Revankar1 , W. Z. Gandhare1 , Dilip Rathod2

  • 1Government College of Engineering, Aurangabad, India.
  • 2Dept. of Information Technology, P. E. S. College of Engineering, Aurangabad, India.

Abstract

Neural cryptography is based on synchronization of tree parity machines by mutual learning. We extend previous key-exchange protocols by replacing random inputs with queries depending on the current state of the neural networks. The results show that queries restore the security against attackers. We further restrict amount information available to an attacker by keeping seed of pseudo randomnumber generator private.

Keywords

  • Neural cryptography
  • query
  • mutual learning
  • tree parity machine
  • neural synchronization
  • encryption/decryption
220-H307

How to Cite

Copied

Pravin Revankar, W. Z. Gandhare, and Dilip Rathod, "Private Inputs to Tree Parity Machine," International Journal of Computer Theory and Engineering, vol. 2, no. 4, pp. 665-669, 2010. https://doi.org/10.7763/IJCTE.2010.V2.220

Copyright & License

Copyright © 2010 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu