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

Figure 6

The probability of success of a majority attack with K = 3, N = 1000, L = 10, and M = 100 according to the learning rules. We measured the values of the result with 10,000 repeated experiments.