First, the dynamics of the synchronization process by mutual learning between permutation parity machines has been studied. By the way, the dynamics can be described by a first-order Markovian process. It has turned out that for neural synchronization, permutation parity machines form a viable alternative to tree parity machines.
Literature:
- O. Reyes, I. Kopitzke, K.-H. Zimmermann: Permutation parity machines for neural synchronization. J. Physics A: Math. Theor., vol. 42, 195002, 2009.
Second, the ability to synchronization between two permutation parity machines has been used to introduce a key-exchange protocol. This approach is quite similar to the case of tree parity machines. We have studied their performance against common attacks (simple, geometric, majority and genetic). It appears that the permutation parity machines (in opposition to tree parity machines) are rather immune against those attacks.
Literature:
- O. Reyes, K.-H. Zimmermann: Permutation parity machines for neural cryptography. Phys. Rev. E, vol. 81, 066117, 2010.
This paper was awared recently:
We are pleased to inform you that your article, "Permutation parity machines for neural cryptography," published in Physical Review E 81, 066117 (2010), has been selected for the July 1, 2010 issue of Virtual Journal of Biological Physics Research. The Virtual Journal, which is published by the American Physical Society and the American Institute of Physics in cooperation with numerous other societies and publishers, is an edited compilation of links to articles from participating publishers, covering a focused area of frontier research. You can access the Virtual Journal at http://www.vjbio.org -- thank you for your contribution. ...
Sincerely,
Robert H. Austin, Editor
Currently, the objective is to apply permutation parity machines to light-weight security, especially RFIDs. At this point, we want to set up several student projects.
No comments:
Post a Comment