Successful attack on permutationparitymachinebased neural cryptography
Abstract
An algorithm is presented which implements a probabilistic attack on the keyexchange protocol based on permutation parity machines. Instead of imitating the synchronization of the communicating partners, the strategy consists of a Monte Carlo method to sample the space of possible weights during inner rounds and an analytic approach to convey the extracted information from one outer round to the next one. The results show that the protocol under attack fails to synchronize faster than an eavesdropper using this algorithm.
 Publication:

Physical Review E
 Pub Date:
 February 2012
 DOI:
 10.1103/PhysRevE.85.025101
 arXiv:
 arXiv:1111.5792
 Bibcode:
 2012PhRvE..85b5101S
 Keywords:

 84.35.+i;
 87.18.Sn;
 89.70.a;
 05.10.Ln;
 Neural networks;
 Information and communication theory;
 Monte Carlo methods;
 Computer Science  Cryptography and Security;
 Condensed Matter  Disordered Systems and Neural Networks
 EPrint:
 4 pages, 2 figures