Efficiency Comparison Clause Samples

Efficiency Comparison. The results of the efficiency comparison between SGPAKE and PL-GAKA are illustrated in Table 3. Since this paper focuses on the cloud meeting and improves SGPAKE in the cloud meeting, we compare PL-GAKA with SGPAKE. For the Exponentiation evaluation, SGPAKE requires 4(2a ) because of two modular exponential computations for generating session keys. According to the properties of cloud meetings, the participant list can be determined before PL-GAKA starts, so the heavy work can be well prepared, and the computation cost can be finished from an offline computation. Table 3. The efficiency comparison between SGPAKE and PL-GAKA. Password Maintenance Yes No Exponentiation Yes No Key Calculation Modular Exponentiation Extented Choatic Map For the efficiency of the session key calculation process, PL-GAKA considers the extended chaotic map, which is a lightweight calculation compared with the modular exponential computation. Thus, PL-GAKA requires less computation time to generate a session key than that of SGPAKE. On the other hand, the meeting member does not require a password to verify the identity in PL-GAKA, so the password maintenance mechanism is not necessary in Pl-GAKA, but it is required in SGPAKE. Putting the above together, PL-GAKA is more efficient than SGPAKE in terms of key generation and the user maintenance.
Efficiency Comparison. Compared with similar KA protocols, the proposed KA protocol in this paper has many advantages. The comparison results are shown in Table 2. The protocols in Refs. [21,29] are based on bilinear pairings, which are time consumption as one pairing operation is about 11110 multiplications in finite field F3163. Then, the main operation in these protocols is point multiplication, and the proposed KA protocol utilizes the least point multiplication computation. Moreover, the proposed KA protocol only needs one-time information transmission, which can save half the time burden of the information authenticated in the session key agreement phase compared with one-round protocols. Although the KA protocol in Ref. [29] is also one-pass, it needs bilinear pairings, which are the time consumption operations.