Vector key pre-distribution scheme

Abstract

In article the keys preliminary distribution scheme using calculations in the any vector space is suggested. The secret information is generated on the server as linear operator. The linear operator has to be the symmetric. The open vector is compared to each user. Key materials are calculated by the server based on the secret linear operator and open vectors. Key materials are transferred to users via a secure channel. Pair keys are calculated based on open vectors and key materials. Two vector spaces are considered. The first case is space over Zp. The linear operator is a square symmetrical matrix. Restrictions for the matrix size are received. It is shown that the Blom’s keys preliminary distribution scheme is a special case of this scheme. The second case this vector space of smooth functions. Secret is defined by the linear differential operator. If to be limited to final basis, then the second case comes down to the first.