Neural Cryptography Based on Generalized Tree Parity Machine for Real-Life Systems

Figure 5

The probability of success of a majority attack with K = 3, N = 1000, and M = 100. We used the random walk learning rule to update the weight vectors and measure the values of the result with 10,000 repeated experiments.