Polynomial Degree Sample Clauses

Polynomial Degree. All nodes in the network hold partial information of one t- degree (k + 1)-variate polynomial to achieve key agreement. Some nodes may be corrupted and cooperate to expose the polynomial with the partial information they hold whereby to calculate keys between other nodes directly. Obviously, the polynomial degree t is an indication of the difficulty to expose the polynomial, and it is directly related to the memory cost per node. In this section, we will investigate how to choose the polynomial degree. = 1 ( N )(Σ N + k) , (14) i=1 where the total number of nodes in the network is N = · ··· N1 N2 Nk. . Σ . The number of coefficients of a t-degree (k + 1)-variate symmetric polynomial is [4] N = t + k + 1 (15)