Abstract

Synchronization of two neural networks through mutual learning is used to exchange the key over a public channel. In the absence of a weight vector from another party, the key challenge with neural synchronization is how to assess the coordination of two communication parties. There is an issue of delay in the current techniques in the synchronization assessment that has an impact on the security and privacy of the neural synchronization. In this paper, to assess the complete coordination of a cluster of neural networks more efficiently and timely, an important strategy for assessing coordination is presented. To approximately determine the degree of synchronization, the frequency of the two networks having the same output in prior iterations is used. The hash is used to determine if both the networks are completely synchronized exactly when a certain threshold is crossed. The improved technique makes absolute coordination between two communication parties using the weight vectors’ has value. In contrast, with existing approaches, two communicating parties who follow the proposed approach will detect complete synchronization sooner. This reduces the effective geometric likelihood. The proposed method, therefore, increases the safety of the protocol for neural key exchange. This proposed technique has been passed through different parametric tests. Simulations of the process show effectiveness in terms of cited results in the paper.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.