Complexity Analyses Sample Clauses

Complexity Analyses ncom−1 . Σ Computational complexity analysis is realized by adding up the key generation attempts of both parties. The server generates only one key at the beginning of the protocol and in upcoming rounds, computations are made by selecting one less block out of ncom, the complexity of which is calculated as ncom . Iterations stop when the correct key blocks. Hence, the average the server is 19; hence, the average communication cost of . Σthis message is 256 × = 4864 bits = 608 bytes. In the average case, the protocol stops after this round. So the cost of this message is the maximum cost of the messages sent by the server. If the user still cannot verify any of the HMAC values, (s)he sends another RETRY message. Otherwise, the user sends a positive acknowledgment with the index of the HMAC value that is verified, which is a 32 bit integer. Thus, the maximum communication cost of this message is 1 + 32 = 33 bits. Therefore, the total size of the messages transmitted by the server and the user are approximately 644 bytes and 62 KB, respectively. All of the communication costs given above are quite reasonable for today’s Internet speeds.