Physics – Condensed Matter – Statistical Mechanics
Scientific paper
2002-02-20
Physics
Condensed Matter
Statistical Mechanics
Scientific paper
10.1088/0305-4470/35/47/104
Mutual learning process between two parity feed-forward networks with discrete and continuous weights is studied analytically, and we find that the number of steps required to achieve full synchronization between the two networks in the case of discrete weights is finite. The synchronization process is shown to be non-self-averaging and the analytical solution is based on random auxiliary variables. The learning time of an attacker that is trying to imitate one of the networks is examined analytically and is found to be much longer than the synchronization time. Analytical results are found to be in agreement with simulations.
Kanter Ido
Kinzel Wolfgang
Rosen-Zvi Michal
No associations
LandOfFree
Cryptography based on neural networks - analytical results does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cryptography based on neural networks - analytical results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptography based on neural networks - analytical results will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-538580