DISTRIBUTION OF THE TREE PARITY MACHINE SYNCHRONIZATION TIME
Michał Dolecki 1  
,   Ryszard Kozera 1, 2  
 
More details
Hide details
1
Faculty of Mathematics, IT and Landscape Architecture, The John Paul II Katholic University of Lublin, ul. Konstantynów 1H, 20-708 Lublin, Poland
2
Faculty of Applied Informatics and Mathematics, Warsaw University of Life Sciences – SGGW, ul. Nowoursy-nowska 159, 02-776 Warsaw, Poland
Publication date: 2013-06-10
 
Adv. Sci. Technol. Res. J. 2013; 7(18):20–27
 
KEYWORDS
ABSTRACT
Neural networks’ synchronization by mutual learning discovered and described by Kanter et al. [10] can be used to construct relatively secure cryptographic key exchange protocol in the open channel. This phenomenon based on simple mathematical operations, can be performed fast on a computer. The latter makes it competitive to the currently used cryptographic algorithms. An additional advantage is the easiness in system scaling by adjusting neutral network’s topology, what results in satisfactory level of security [21] despite different attack attempts [10, 13]. With the aid of previous experiments, it turns out that the above synchronization procedure is a stochastic process. Though the time needed to achieve compatible weights vectors in both partner networks depends on their topology, the histograms generated herein render similar distribution patterns. In this paper the simulations and the analysis of synchronizations’ time are performed to test whether these histograms comply with histograms of a particular well-known statistical distribution. As verified in this work, indeed they coincide with Poisson distribution. The corresponding parameters of the empirically established Poisson distribution are also estimated in this work. Evidently the calculation of such parameters permits to assess the probability of achieving both networks’ synchronization in a given time only upon resorting to the generated distribution tables. Thus, there is no necessity of redoing again time-consuming computer simulations.