Memory Size Clause Samples

Memory Size. The memory cost of the proposed scheme was evaluated by computing the length of the message sent by the sensor node and the central server. The memory cost is discussed below. The proposed protocol consists of three steps. In the first step, the sensor node generates QSN = h(tokenSN ||IDSN ||STAMPp1), which is 160 bits long. In the second step, the central server verifies the identity of the sensor node by computing the authentication message QSN1 = h(tokenSN ||IDSN ||STAMPp1). Then, the central server generates the CRT parameter a1 and two 256-bit key pairs. In the final step, the sensor node receives the parameters from the central server; the sensor node also chooses a random number a2 and generates a key pair. The sensor node sends a1 and the public key to the central server. As mentioned above, the sensor nodes are equipped with limited computing power, storage, and communication modules. Therefore, we adopt lightweight combination method based on Chinese Remainder Theorem and ECDH to generate the shared key. Assume that the eclipse curve key length is 256 bits. Table 3 shows the length of every parameter used in our scheme. The detail analysis of memory cost is demonstrated from two sides: the sensor node side and the central server side.