Synchronization Verification Improvement of Two Tree Parity Machines Using Polynomial Function

Abstract

One of the problems of cryptography based on the tree parity machine is how to recognize that two tree parity machines are synchronized. In this paper, one of the possible solutions based on polynomial function is described. The proposed method is focused on obtaining of one unique number by polynomial function. Next is improvement of security during verification of the synchronization process using memory of weights and polynomial function.