An Information Rate of Key Predistribution Schemes with Mutually Complementary Correctness Conditions

Abstract

In this paper we study the key predistribution schemes. Such schemes are used to reduce the total amount of secret information distributed to users of the network through secure channels, through which the secret key is calculated to establish a secure network connection between the participants. It is shown as a theoretical and practical advantage of the combined scheme in the scheme efficiency parameters with the help of computer experiments, as well as lower and sufficient estimates of the probabilistic algorithm synthesis of a key distribution patterns with mutually complementary correctness conditions of the two known schemes (KDP, Key Distribution Pattern and HARPS, Hashed Random Preloaded Subset Key Distribution). The concept of the information rate of the scheme is considered as a criterion for the efficiency of the key distribution scheme in the task of minimizing the distributed volume of secret information stored by the network participants. Calculated lower estimates shows potential advantage of combined correcntess conditions in addition to efficiency discovered previously.