Content deleted Content added
→Protocol: The synchronization of the weights begins when the outputs are different and then the Hebbian learning rule is applied. |
|||
Line 77:
==== Brute force ====
To provide a brute force attack, an attacker has to test all possible keys (all possible values of weights wij). By K hidden neurons, K*N input neurons and boundary of weights L, this gives (2L+1)<sup>KN</sup> possibilities. For example, the configuration K = 3, L = 3 and N = 100 gives us 3*10<sup>253</sup> key possibilities, making the attack impossible with today’s computer power. all wrong
==== Learning with own tree parity machine ====
| |||