Key Updating Methods for Combinatorial Design Based Key Management Schemes

Table 2

The mapping from unital to key predistribution.

Unital design	Key predistribution
X: element set	𝑆: key pool
Size of the object set X: 𝜈=𝑚^3+1	The number of keys |𝑆|=𝑚^3+1
Blocks	Key rings
Size of block 𝑋:	The number of keys of each ring has 𝑋: 𝑙=𝑚^3+1
Number of generated blocks; 𝑏=𝑚^2(𝑚^2−𝑚+1)	Number of generated key rings (supported nodes); 𝑛=𝑚^2(𝑚^2−𝑚+1)
Each point belongs to exactly 𝑚^2 blocks	Each key appears in exactly 𝑚^2 key rings